%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC072-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:42:52 PM UTC 2026
% Result : Unsatisfiable 53.32s 8.21s
% Output : CNFRefutation 53.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 38
% Syntax : Number of clauses : 167 ( 38 unt; 22 nHn; 152 RR)
% Number of literals : 510 ( 152 equ; 343 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 233 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause170,axiom,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| cons(X1,X2) != cons(X3,X4)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause170) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(co1_7,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause61,axiom,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause59,axiom,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause59) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_39,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_40,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
c_0_38 ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_42,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_43,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_45,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk4) != X4
| tl(sk4) != X2
| sk3 = X1 ),
inference(cn,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_41 ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_50,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_42 ).
cnf(c_0_51,negated_conjecture,
( nil != sk4
| nil != sk1 ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])])])])]),c_0_47]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_48 ).
cnf(c_0_54,axiom,
ssList(nil),
clause8 ).
cnf(c_0_55,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_56,negated_conjecture,
nil != sk4,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_46]),c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(sk4,nil)
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]),c_0_56]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_53]),c_0_55]),c_0_54])]),c_0_56]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_58 ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_55])]),c_0_56]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_61 ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_55])]),c_0_56]) ).
cnf(c_0_66,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_64 ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_69,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssItem(hd(sk4))
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_54])]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_67 ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_68 ).
cnf(c_0_73,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_74,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_75,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_69 ).
cnf(c_0_76,negated_conjecture,
app(tl(sk4),cons(hd(sk4),nil)) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_60]),c_0_55])]),c_0_56]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| nil = X1
| tl(X1) = skaf82(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| app(X1,cons(hd(sk4),nil)) != sk1
| tl(sk4) = X1 ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
app(skaf82(sk4),cons(hd(sk4),nil)) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_55])]),c_0_56]) ).
cnf(c_0_80,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_81,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| tl(sk4) = skaf82(sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_74])]) ).
cnf(c_0_83,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_84,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_80 ).
cnf(c_0_85,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_81 ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| tl(sk4) = skaf82(sk4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_63]),c_0_55])]),c_0_56]) ).
cnf(c_0_88,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_83 ).
cnf(c_0_89,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_84]),c_0_47]) ).
cnf(c_0_90,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_86 ).
cnf(c_0_92,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_93,plain,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| cons(X1,X2) != cons(X3,X4)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause170]) ).
cnf(c_0_94,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_95,negated_conjecture,
( ~ ssItem(hd(sk4))
| tl(sk4) = skaf82(sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_66]),c_0_54])]) ).
cnf(c_0_96,plain,
( ~ ssList(X1)
| nil = X1
| hd(X1) = skaf83(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_72]),c_0_73]),c_0_74])]) ).
cnf(c_0_97,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| frontsegP(sk1,tl(sk4)) ),
inference(spm,[status(thm)],[c_0_89,c_0_76]) ).
cnf(c_0_98,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_99,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_100,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_101,plain,
( ~ duplicatefreeP(app(app(X2,cons(hd(X1),X3)),X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X2,cons(hd(X1),X3)),X1))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_63]),c_0_60]) ).
cnf(c_0_102,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_92 ).
cnf(c_0_103,plain,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| cons(X1,X2) != cons(X3,X4)
| X1 = X3 ),
c_0_93 ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_94 ).
cnf(c_0_105,negated_conjecture,
tl(sk4) = skaf82(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_73]),c_0_55])]),c_0_56]) ).
cnf(c_0_106,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| frontsegP(sk1,tl(sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_63]),c_0_55])]),c_0_56]) ).
cnf(c_0_107,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_98 ).
cnf(c_0_108,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_99 ).
cnf(c_0_109,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_100 ).
cnf(c_0_110,negated_conjecture,
( ~ duplicatefreeP(app(sk1,sk4))
| ~ ssList(app(sk1,sk4)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_79]),c_0_54]),c_0_74]),c_0_55])]),c_0_56]) ).
cnf(c_0_111,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_47]) ).
cnf(c_0_112,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_113,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_114,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| skaf83(cons(X1,X2)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_72]),c_0_73]),c_0_74])])]),c_0_66]),c_0_104]) ).
cnf(c_0_115,negated_conjecture,
cons(hd(sk4),skaf82(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_105]),c_0_55])]),c_0_56]) ).
cnf(c_0_116,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_117,negated_conjecture,
( ~ ssItem(hd(sk4))
| frontsegP(sk1,tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_66]),c_0_54])]) ).
cnf(c_0_118,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_119,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_120,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(app(cons(X1,nil),X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_107]) ).
cnf(c_0_121,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_54])]) ).
cnf(c_0_122,negated_conjecture,
( ~ ssList(app(sk1,sk4))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),c_0_55])]) ).
cnf(c_0_123,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_113 ).
cnf(c_0_124,negated_conjecture,
( ~ ssItem(hd(sk4))
| hd(sk4) = skaf83(sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_74])]) ).
cnf(c_0_125,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_116 ).
cnf(c_0_126,negated_conjecture,
frontsegP(sk1,tl(sk4)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_60]),c_0_55])]),c_0_56]) ).
cnf(c_0_127,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_128,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_118 ).
cnf(c_0_129,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_119 ).
cnf(c_0_130,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_54])]) ).
cnf(c_0_131,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_47]),c_0_112]),c_0_55])]) ).
cnf(c_0_132,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_133,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| app(tl(sk4),X1) != sk1
| cons(hd(sk4),nil) = X1 ),
inference(spm,[status(thm)],[c_0_123,c_0_76]) ).
cnf(c_0_134,negated_conjecture,
hd(sk4) = skaf83(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_60]),c_0_55])]),c_0_56]) ).
cnf(c_0_135,negated_conjecture,
( ~ ssList(tl(sk4))
| app(tl(sk4),skaf45(sk1,tl(sk4))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_112])]) ).
cnf(c_0_136,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_127 ).
cnf(c_0_137,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_138,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_131])]) ).
cnf(c_0_139,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
c_0_132 ).
cnf(c_0_140,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) != nil ),
inference(spm,[status(thm)],[c_0_104,c_0_107]) ).
cnf(c_0_141,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_142,plain,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_143,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(skaf83(sk4),nil))
| app(skaf82(sk4),X1) != sk1
| cons(skaf83(sk4),nil) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_105]),c_0_105]),c_0_74])]),c_0_134]),c_0_134]) ).
cnf(c_0_144,negated_conjecture,
app(tl(sk4),skaf45(sk1,tl(sk4))) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_63]),c_0_55])]),c_0_56]) ).
cnf(c_0_145,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_136,c_0_44]) ).
cnf(c_0_146,negated_conjecture,
( ~ ssList(X1)
| segmentP(app(sk1,X1),cons(skaf83(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_79]),c_0_74])]),c_0_134]),c_0_138])]) ).
cnf(c_0_147,plain,
( ~ ssList(X1)
| app(X1,skaf45(X1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_125,c_0_139]) ).
cnf(c_0_148,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_149,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_121]),c_0_54])]) ).
cnf(c_0_150,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_141 ).
cnf(c_0_151,plain,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
c_0_142 ).
cnf(c_0_152,plain,
( ~ ssList(X1)
| nil = X1
| app(cons(hd(X1),nil),tl(X1)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_107]),c_0_63]),c_0_60]) ).
cnf(c_0_153,negated_conjecture,
( ~ ssList(X1)
| app(skaf82(sk4),X1) != sk1
| cons(skaf83(sk4),nil) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_138])]) ).
cnf(c_0_154,negated_conjecture,
app(skaf82(sk4),skaf45(sk1,skaf82(sk4))) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_105]),c_0_105]) ).
cnf(c_0_155,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_53]),c_0_54])]) ).
cnf(c_0_156,negated_conjecture,
segmentP(sk1,cons(skaf83(sk4),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]),c_0_112])]) ).
cnf(c_0_157,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_131])]) ).
cnf(c_0_158,plain,
( ~ ssList(X1)
| app(skaf46(X1,X1),X1) = X1 ),
inference(spm,[status(thm)],[c_0_150,c_0_151]) ).
cnf(c_0_159,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_160,negated_conjecture,
app(cons(skaf83(sk4),nil),skaf82(sk4)) = sk4,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_105]),c_0_55])]),c_0_56]),c_0_134]) ).
cnf(c_0_161,negated_conjecture,
cons(skaf83(sk4),nil) = skaf45(sk1,skaf82(sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_148])]) ).
cnf(c_0_162,negated_conjecture,
~ segmentP(sk4,cons(skaf83(sk4),nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_138])]),c_0_157]) ).
cnf(c_0_163,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_158]),c_0_159])]) ).
cnf(c_0_164,negated_conjecture,
app(skaf45(sk1,skaf82(sk4)),skaf82(sk4)) = sk4,
inference(rw,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_165,negated_conjecture,
~ segmentP(sk4,skaf45(sk1,skaf82(sk4))),
inference(rw,[status(thm)],[c_0_162,c_0_161]) ).
cnf(c_0_166,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_74]),c_0_148])]),c_0_165]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC072-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:53:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 53.32/8.21 % Version: 3.5.1
% 53.32/8.21 % Preprocessing class: FSLSSMSSSSSNFFN.
% 53.32/8.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.32/8.21 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 53.32/8.21 % Starting new_bool_3 with 300s (1) cores
% 53.32/8.21 % Starting new_bool_1 with 300s (1) cores
% 53.32/8.21 % Starting sh5l with 300s (1) cores
% 53.32/8.21 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2645352 completed with status 0
% 53.32/8.21 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 53.32/8.21 % Preprocessing class: FSLSSMSSSSSNFFN.
% 53.32/8.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.32/8.21 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 53.32/8.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 53.32/8.21 % No SInE strategy applied
% 53.32/8.21 % Search class: FGHSM-FSLM21-MFFFFFNN
% 53.32/8.21 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 53.32/8.21 % Starting SubtermCWHack with 136s (1) cores
% 53.32/8.21 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 53.32/8.21 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 53.32/8.21 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 53.32/8.21 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 53.32/8.21 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2645362 completed with status 0
% 53.32/8.21 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 53.32/8.21 % Preprocessing class: FSLSSMSSSSSNFFN.
% 53.32/8.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.32/8.21 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 53.32/8.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 53.32/8.21 % No SInE strategy applied
% 53.32/8.21 % Search class: FGHSM-FSLM21-MFFFFFNN
% 53.32/8.21 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 53.32/8.21 % Starting SubtermCWHack with 136s (1) cores
% 53.32/8.21 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 53.32/8.21 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 53.32/8.21 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 53.32/8.21 % Preprocessing time : 0.004 s
% 53.32/8.21
% 53.32/8.21 % Proof found!
% 53.32/8.21 % SZS status Unsatisfiable
% 53.32/8.21 % SZS output start CNFRefutation
% See solution above
% 53.32/8.21 % Parsed axioms : 195
% 53.32/8.21 % Removed by relevancy pruning/SinE : 0
% 53.32/8.21 % Initial clauses : 195
% 53.32/8.21 % Removed in clause preprocessing : 0
% 53.32/8.21 % Initial clauses in saturation : 195
% 53.32/8.21 % Processed clauses : 18548
% 53.32/8.21 % ...of these trivial : 316
% 53.32/8.21 % ...subsumed : 13790
% 53.32/8.21 % ...remaining for further processing : 4442
% 53.32/8.21 % Other redundant clauses eliminated : 2278
% 53.32/8.21 % Clauses deleted for lack of memory : 0
% 53.32/8.21 % Backward-subsumed : 454
% 53.32/8.21 % Backward-rewritten : 870
% 53.32/8.21 % Generated clauses : 266045
% 53.32/8.21 % ...of the previous two non-redundant : 254590
% 53.32/8.21 % ...aggressively subsumed : 0
% 53.32/8.21 % Contextual simplify-reflections : 879
% 53.32/8.21 % Paramodulations : 263683
% 53.32/8.21 % Factorizations : 2
% 53.32/8.21 % NegExts : 0
% 53.32/8.21 % Equation resolutions : 2325
% 53.32/8.21 % Disequality decompositions : 0
% 53.32/8.21 % Total rewrite steps : 258869
% 53.32/8.21 % ...of those cached : 256508
% 53.32/8.21 % Propositional unsat checks : 0
% 53.32/8.21 % Propositional check models : 0
% 53.32/8.21 % Propositional check unsatisfiable : 0
% 53.32/8.21 % Propositional clauses : 0
% 53.32/8.21 % Propositional clauses after purity: 0
% 53.32/8.21 % Propositional unsat core size : 0
% 53.32/8.21 % Propositional preprocessing time : 0.000
% 53.32/8.21 % Propositional encoding time : 0.000
% 53.32/8.21 % Propositional solver time : 0.000
% 53.32/8.21 % Success case prop preproc time : 0.000
% 53.32/8.21 % Success case prop encoding time : 0.000
% 53.32/8.21 % Success case prop solver time : 0.000
% 53.32/8.21 % Current number of processed clauses : 3055
% 53.32/8.21 % Positive orientable unit clauses : 351
% 53.32/8.21 % Positive unorientable unit clauses: 0
% 53.32/8.21 % Negative unit clauses : 541
% 53.32/8.21 % Non-unit-clauses : 2163
% 53.32/8.21 % Current number of unprocessed clauses: 226255
% 53.32/8.21 % ...number of literals in the above : 1525333
% 53.32/8.21 % Current number of archived formulas : 0
% 53.32/8.21 % Current number of archived clauses : 1363
% 53.32/8.21 % Clause-clause subsumption calls (NU) : 1256594
% 53.32/8.21 % Rec. Clause-clause subsumption calls : 222484
% 53.32/8.21 % Non-unit clause-clause subsumptions : 6974
% 53.32/8.21 % Unit Clause-clause subsumption calls : 58395
% 53.32/8.21 % Rewrite failures with RHS unbound : 0
% 53.32/8.21 % BW rewrite match attempts : 228
% 53.32/8.21 % BW rewrite match successes : 138
% 53.32/8.21 % Condensation attempts : 0
% 53.32/8.21 % Condensation successes : 0
% 53.32/8.21 % Termbank termtop insertions : 6870660
% 53.32/8.21 % Search garbage collected termcells : 567
% 53.32/8.21
% 53.32/8.21 % -------------------------------------------------
% 53.32/8.21 % User time : 7.326 s
% 53.32/8.21 % System time : 0.240 s
% 53.32/8.21 % Total time : 7.566 s
% 53.32/8.21 % Maximum resident set size: 4068 pages
% 53.32/8.21
% 53.32/8.21 % -------------------------------------------------
% 53.32/8.21 % User time : 36.713 s
% 53.32/8.21 % System time : 1.384 s
% 53.32/8.21 % Total time : 38.096 s
% 53.32/8.21 % Maximum resident set size: 4864 pages
% 53.32/8.21 % E exiting
%------------------------------------------------------------------------------