%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC341-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:44:00 PM UTC 2026
% Result : Unsatisfiable 195.78s 29.33s
% Output : CNFRefutation 195.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 40
% Syntax : Number of formulae : 171 ( 42 unt; 0 def)
% Number of atoms : 475 ( 123 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 611 ( 307 ~; 302 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 235 ( 15 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause113,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| totalorderedP(cons(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause113) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_38,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_39,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_40,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_42,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_44,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_45,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( sk4 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_50,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
c_0_44 ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_52,negated_conjecture,
( ~ segmentP(sk4,nil)
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_48 ).
cnf(c_0_54,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_49,c_0_41]) ).
cnf(c_0_55,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_57,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_50,c_0_43]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_51 ).
cnf(c_0_59,axiom,
ssList(nil),
clause8 ).
cnf(c_0_60,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_61,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_55 ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_63,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_56 ).
cnf(c_0_66,negated_conjecture,
cons(sk5,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_58]),c_0_54]),c_0_59])]),c_0_60]) ).
cnf(c_0_67,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_54]),c_0_59])]),c_0_60]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_62 ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_63 ).
cnf(c_0_70,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_64 ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_72,negated_conjecture,
tl(sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_66]),c_0_67]),c_0_59])]) ).
cnf(c_0_73,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_74,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_66]),c_0_67]),c_0_59])]) ).
cnf(c_0_75,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_76,negated_conjecture,
( ~ ssList(X1)
| tl(cons(sk5,X1)) = app(nil,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_73])]),c_0_74]) ).
cnf(c_0_77,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_75 ).
cnf(c_0_78,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_66]),c_0_72]),c_0_59])]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_59])]) ).
cnf(c_0_81,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_79 ).
cnf(c_0_82,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_66]),c_0_67])]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_84,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_85,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_86,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| tl(app(cons(X1,X2),X3)) = app(X2,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_77]),c_0_81]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssItem(X1)
| app(cons(X1,sk1),nil) = cons(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_82]),c_0_59]),c_0_73])]) ).
cnf(c_0_88,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_83 ).
cnf(c_0_89,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_84 ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_85 ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_92,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssItem(X1)
| tl(cons(X1,sk1)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_82]),c_0_59]),c_0_73])]) ).
cnf(c_0_94,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,tl(cons(X1,X2))) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_69]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_96,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_77]),c_0_81]) ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_91 ).
cnf(c_0_98,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_92 ).
cnf(c_0_100,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_101,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_102,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_103,negated_conjecture,
app(nil,sk1) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_93]),c_0_73]),c_0_67])]) ).
cnf(c_0_104,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,app(nil,X1)) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_76]),c_0_67])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_95 ).
cnf(c_0_106,negated_conjecture,
( ~ ssItem(X1)
| ssList(cons(X1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_87]),c_0_59]),c_0_73])]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| cons(skaf44(X1),X2) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_97]),c_0_98])]) ).
cnf(c_0_108,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_99]) ).
cnf(c_0_109,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_100 ).
cnf(c_0_110,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| hd(app(cons(X1,X2),X3)) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_77]),c_0_81]) ).
cnf(c_0_111,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_101 ).
cnf(c_0_112,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_102 ).
cnf(c_0_113,negated_conjecture,
( ~ ssItem(X1)
| app(cons(X1,nil),sk1) = cons(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_103]),c_0_73]),c_0_59])]) ).
cnf(c_0_114,negated_conjecture,
( ~ ssList(X1)
| nil != X1
| cons(sk5,X1) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_66]),c_0_59])]) ).
cnf(c_0_115,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssList(app(X1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_98]),c_0_73])]) ).
cnf(c_0_116,negated_conjecture,
singletonP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_66]),c_0_67]),c_0_73])]) ).
cnf(c_0_117,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_118,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_119,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_120,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil = X1
| cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_70]),c_0_81]),c_0_109]) ).
cnf(c_0_121,negated_conjecture,
( ~ ssList(X1)
| hd(app(sk1,X1)) = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_66]),c_0_67]),c_0_59])]) ).
cnf(c_0_122,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_59])]) ).
cnf(c_0_123,negated_conjecture,
app(sk1,sk1) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_67]),c_0_59])]) ).
cnf(c_0_124,negated_conjecture,
ssList(app(sk1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_73])]) ).
cnf(c_0_125,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_117 ).
cnf(c_0_126,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_118 ).
cnf(c_0_127,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_119 ).
cnf(c_0_128,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_129,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_130,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,app(nil,X1)) = app(sk1,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_72]),c_0_73])]),c_0_74]) ).
cnf(c_0_131,negated_conjecture,
app(nil,cons(sk5,sk1)) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_73])]) ).
cnf(c_0_132,negated_conjecture,
ssList(cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_71]),c_0_73])]) ).
cnf(c_0_133,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_125]) ).
cnf(c_0_134,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(X1,cons(X2,X3)) != X4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128]),c_0_129])]) ).
cnf(c_0_135,negated_conjecture,
app(sk1,cons(sk5,sk1)) = cons(sk5,cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]) ).
cnf(c_0_136,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_66]),c_0_67]),c_0_59])]) ).
fof(c_0_137,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_138,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_111]),c_0_81]) ).
cnf(c_0_139,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_140,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| cons(sk5,cons(sk5,sk1)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_67]),c_0_73])]) ).
cnf(c_0_141,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_137]) ).
cnf(c_0_142,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,cons(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_123]),c_0_73])]) ).
fof(c_0_143,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_144,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_139 ).
cnf(c_0_145,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,cons(sk5,sk1)) != X1
| epred2_0 ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_146,negated_conjecture,
ssList(cons(sk5,cons(sk5,sk1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_71]),c_0_73]),c_0_132])]) ).
cnf(c_0_147,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_148,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_144,c_0_143]),c_0_137]) ).
cnf(c_0_149,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_145]),c_0_146])]) ).
cnf(c_0_150,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_147 ).
cnf(c_0_151,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_143]) ).
cnf(c_0_152,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_148,c_0_149])]) ).
cnf(c_0_153,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_154,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| totalorderedP(cons(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause113]) ).
cnf(c_0_155,plain,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X2,X4)
| segmentP(app(X1,app(X2,X3)),X4) ),
inference(spm,[status(thm)],[c_0_150,c_0_111]) ).
cnf(c_0_156,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_157,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_153 ).
cnf(c_0_158,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| totalorderedP(cons(X2,X1)) ),
c_0_154 ).
cnf(c_0_159,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk1,X3)
| segmentP(app(X1,cons(sk5,X2)),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_71]),c_0_73])]) ).
cnf(c_0_160,plain,
( ~ ssList(X1)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_156])]) ).
cnf(c_0_161,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_112]),c_0_59])]) ).
cnf(c_0_162,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_163,negated_conjecture,
totalorderedP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_66]),c_0_67]),c_0_59])]) ).
cnf(c_0_164,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(sk1,X2)
| ~ memberP(X1,sk5)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_129]),c_0_128])]) ).
cnf(c_0_165,negated_conjecture,
( ~ ssList(X1)
| sk1 != X1
| segmentP(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_82]),c_0_59]),c_0_73])]) ).
cnf(c_0_166,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
c_0_162 ).
cnf(c_0_167,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_163])]) ).
cnf(c_0_168,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_73])]) ).
cnf(c_0_169,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_58]),c_0_54]),c_0_59])]),c_0_60]) ).
cnf(c_0_170,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC341-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n010.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 08:17:39 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.51 Running first-order theorem proving
% 0.16/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 195.78/29.33 % Version: 3.5.1
% 195.78/29.33 % Preprocessing class: FSLSSMSMSSSNFFN.
% 195.78/29.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.78/29.33 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 195.78/29.33 % Starting new_bool_3 with 300s (1) cores
% 195.78/29.33 % Starting new_bool_1 with 300s (1) cores
% 195.78/29.33 % Starting sh5l with 300s (1) cores
% 195.78/29.33 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 451880 completed with status 0
% 195.78/29.33 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 195.78/29.33 % Preprocessing class: FSLSSMSMSSSNFFN.
% 195.78/29.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.78/29.33 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 195.78/29.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 195.78/29.33 % No SInE strategy applied
% 195.78/29.33 % Search class: FGHSM-FSLM21-MFFFFFNN
% 195.78/29.33 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 195.78/29.33 % Starting SubtermCWHack with 136s (1) cores
% 195.78/29.33 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 195.78/29.33 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 195.78/29.33 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 195.78/29.33 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 195.78/29.33 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 451886 completed with status 0
% 195.78/29.33 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 195.78/29.33 % Preprocessing class: FSLSSMSMSSSNFFN.
% 195.78/29.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.78/29.33 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 195.78/29.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 195.78/29.33 % No SInE strategy applied
% 195.78/29.33 % Search class: FGHSM-FSLM21-MFFFFFNN
% 195.78/29.33 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 195.78/29.33 % Starting SubtermCWHack with 136s (1) cores
% 195.78/29.33 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 195.78/29.33 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 195.78/29.33 % Preprocessing time : 0.006 s
% 195.78/29.33 % Presaturation interreduction done
% 195.78/29.33
% 195.78/29.33 % Proof found!
% 195.78/29.33 % SZS status Unsatisfiable
% 195.78/29.33 % SZS output start CNFRefutation
% See solution above
% 195.78/29.33 % Parsed axioms : 196
% 195.78/29.33 % Removed by relevancy pruning/SinE : 0
% 195.78/29.33 % Initial clauses : 196
% 195.78/29.33 % Removed in clause preprocessing : 0
% 195.78/29.33 % Initial clauses in saturation : 196
% 195.78/29.33 % Processed clauses : 25863
% 195.78/29.33 % ...of these trivial : 507
% 195.78/29.33 % ...subsumed : 20201
% 195.78/29.33 % ...remaining for further processing : 5155
% 195.78/29.33 % Other redundant clauses eliminated : 5669
% 195.78/29.33 % Clauses deleted for lack of memory : 0
% 195.78/29.33 % Backward-subsumed : 610
% 195.78/29.33 % Backward-rewritten : 670
% 195.78/29.33 % Generated clauses : 506558
% 195.78/29.33 % ...of the previous two non-redundant : 478673
% 195.78/29.33 % ...aggressively subsumed : 0
% 195.78/29.33 % Contextual simplify-reflections : 1233
% 195.78/29.33 % Paramodulations : 500328
% 195.78/29.33 % Factorizations : 0
% 195.78/29.33 % NegExts : 0
% 195.78/29.33 % Equation resolutions : 6163
% 195.78/29.33 % Disequality decompositions : 0
% 195.78/29.33 % Total rewrite steps : 338599
% 195.78/29.33 % ...of those cached : 333578
% 195.78/29.33 % Propositional unsat checks : 0
% 195.78/29.33 % Propositional check models : 0
% 195.78/29.33 % Propositional check unsatisfiable : 0
% 195.78/29.33 % Propositional clauses : 0
% 195.78/29.33 % Propositional clauses after purity: 0
% 195.78/29.33 % Propositional unsat core size : 0
% 195.78/29.33 % Propositional preprocessing time : 0.000
% 195.78/29.33 % Propositional encoding time : 0.000
% 195.78/29.33 % Propositional solver time : 0.000
% 195.78/29.33 % Success case prop preproc time : 0.000
% 195.78/29.33 % Success case prop encoding time : 0.000
% 195.78/29.33 % Success case prop solver time : 0.000
% 195.78/29.33 % Current number of processed clauses : 3646
% 195.78/29.33 % Positive orientable unit clauses : 259
% 195.78/29.33 % Positive unorientable unit clauses: 0
% 195.78/29.33 % Negative unit clauses : 177
% 195.78/29.33 % Non-unit-clauses : 3210
% 195.78/29.33 % Current number of unprocessed clauses: 446951
% 195.78/29.33 % ...number of literals in the above : 4014423
% 195.78/29.33 % Current number of archived formulas : 0
% 195.78/29.33 % Current number of archived clauses : 1473
% 195.78/29.33 % Clause-clause subsumption calls (NU) : 2972653
% 195.78/29.33 % Rec. Clause-clause subsumption calls : 332141
% 195.78/29.33 % Non-unit clause-clause subsumptions : 11317
% 195.78/29.33 % Unit Clause-clause subsumption calls : 67440
% 195.78/29.33 % Rewrite failures with RHS unbound : 0
% 195.78/29.33 % BW rewrite match attempts : 434
% 195.78/29.33 % BW rewrite match successes : 149
% 195.78/29.33 % Condensation attempts : 0
% 195.78/29.33 % Condensation successes : 0
% 195.78/29.33 % Termbank termtop insertions : 14210601
% 195.78/29.33 % Search garbage collected termcells : 540
% 195.78/29.33
% 195.78/29.33 % -------------------------------------------------
% 195.78/29.33 % User time : 24.760 s
% 195.78/29.33 % System time : 0.669 s
% 195.78/29.33 % Total time : 25.429 s
% 195.78/29.33 % Maximum resident set size: 4068 pages
% 195.78/29.33
% 195.78/29.33 % -------------------------------------------------
% 195.78/29.33 % User time : 135.019 s
% 195.78/29.33 % System time : 4.227 s
% 195.78/29.33 % Total time : 139.245 s
% 195.78/29.33 % Maximum resident set size: 4864 pages
% 195.78/29.33 % E exiting
%------------------------------------------------------------------------------