
--------------------------SPASS-START-----------------------------
Input Problem:
1[0:Inp] ||  -> equal(cat(nil,U),U)**.
2[0:Inp] ||  -> equal(cat(cons(U,V),W),cat(V,W))**.
3[0:Inp] || equal(cat(cons(1,nil),nil),cons(2,nil))** -> .
 This is a unit equality problem.
 This is a problem that has, if any, a non-trivial domain model.
 The conjecture is ground.
 Axiom clauses: 2 Conjecture clauses: 1
 Inferences: IEqR=1 ISpR=1 ISpL=1 
 Reductions: RFRew=1 RBRew=1 RFMRR=1 RBMRR=1 RObv=1 RUnC=1 RTaut=1 RFSub=1 RBSub=1 
 Extras    : Input Saturation, No Selection, No Splitting, Full Reduction,  Ratio: 5, FuncWeight: 1, VarWeight: 1
 Precedence: cat > cons > 2 > 1 > nil
 Ordering  : KBO
Processed Problem:

Worked Off Clauses:

Usable Clauses:
1[0:Inp] ||  -> equal(cat(nil,U),U)**.
3[0:Inp] || equal(cons(2,nil),nil)** -> .
2[0:Inp] ||  -> equal(cat(cons(U,V),W),cat(V,W))**.
	Given clause: 1[0:Inp] ||  -> equal(cat(nil,U),U)**.
	Given clause: 3[0:Inp] || equal(cons(2,nil),nil)** -> .
	Given clause: 2[0:Inp] ||  -> equal(cat(cons(U,V),W),cat(V,W))**.
SPASS V 2.1 
SPASS beiseite: Completion found.
Problem: lispseq0.lop 
SPASS derived 2 clauses, backtracked 0 clauses and kept 3 clauses.
SPASS allocated 457 KBytes.
SPASS spent	0:00:00.05 on the problem.
		0:00:00.00 for the input.
		0:00:00.00 for the FLOTTER CNF translation.
		0:00:00.00 for inferences.
		0:00:00.00 for the backtracking.
		0:00:00.00 for the reduction.

--------------------------SPASS-STOP------------------------------
