%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC078-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 : n014.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:54 PM UTC 2026
% Result : Unsatisfiable 127.95s 19.97s
% Output : CNFRefutation 127.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 42
% Syntax : Number of formulae : 173 ( 41 unt; 0 def)
% Number of atoms : 505 ( 128 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 659 ( 327 ~; 330 |; 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 : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 254 ( 19 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
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(co1_13,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
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(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause178,axiom,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
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(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_40,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_42,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_44,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_41 ).
cnf(c_0_46,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_11 ).
cnf(c_0_47,axiom,
ssList(nil),
clause8 ).
cnf(c_0_48,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_49,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_54,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_13 ).
cnf(c_0_55,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),c_0_48]),c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_10 ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_50 ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_51 ).
cnf(c_0_59,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_52 ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_53 ).
cnf(c_0_63,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_56,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| tl(X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_47])]) ).
cnf(c_0_70,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_61 ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| app(sk3,X1) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_73,negated_conjecture,
tl(sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_63]),c_0_64]),c_0_47])]) ).
cnf(c_0_74,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_65,c_0_43]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_66 ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_67 ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_68 ).
cnf(c_0_78,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_79,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| tl(cons(X1,nil)) = nil ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_80,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_71,c_0_72]),c_0_73]),c_0_74])]),c_0_55]) ).
cnf(c_0_81,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_75,c_0_76]),c_0_77]),c_0_45]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_83,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_78 ).
cnf(c_0_84,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_64]),c_0_63]),c_0_74]),c_0_47])]) ).
cnf(c_0_85,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_81,c_0_80]),c_0_64])]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_82 ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_88,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_83,c_0_84]),c_0_47])]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(X1)
| nil != X1
| cons(sk5,X1) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_63]),c_0_47])]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_87 ).
cnf(c_0_91,negated_conjecture,
app(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_64]),c_0_47])]) ).
cnf(c_0_92,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_57,c_0_83]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssItem(X1)
| app(cons(X1,sk3),nil) = cons(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_91]),c_0_47]),c_0_74])]) ).
cnf(c_0_94,negated_conjecture,
( ~ ssItem(X1)
| tl(cons(X1,sk3)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_91]),c_0_47]),c_0_74])]) ).
cnf(c_0_95,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_96,negated_conjecture,
app(nil,sk3) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_94]),c_0_74]),c_0_64])]) ).
cnf(c_0_97,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_95 ).
cnf(c_0_98,negated_conjecture,
( ~ ssItem(X1)
| app(cons(X1,nil),sk3) = cons(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_96]),c_0_74]),c_0_47])]) ).
cnf(c_0_99,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_100,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_83]),c_0_90]) ).
cnf(c_0_101,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_102,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_103,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(sk3,app(X1,X2)) = app(cons(sk5,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_72]),c_0_74])]) ).
cnf(c_0_104,negated_conjecture,
app(sk3,sk3) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_89]),c_0_64]),c_0_47])]) ).
cnf(c_0_105,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_99 ).
cnf(c_0_106,negated_conjecture,
( ~ ssItem(X1)
| ssList(cons(X1,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_93]),c_0_47]),c_0_74])]) ).
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_62,c_0_58]),c_0_59])]) ).
cnf(c_0_108,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_101 ).
cnf(c_0_109,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_102 ).
cnf(c_0_110,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_111,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_112,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,sk3),X2) = cons(X1,cons(sk5,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_72]),c_0_74])]) ).
cnf(c_0_113,negated_conjecture,
app(cons(sk5,sk3),sk3) = app(sk3,cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_74])]) ).
cnf(c_0_114,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_105]) ).
cnf(c_0_115,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssList(app(X1,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_59]),c_0_74])]) ).
cnf(c_0_116,negated_conjecture,
singletonP(sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_63]),c_0_64]),c_0_74])]) ).
cnf(c_0_117,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_108,c_0_109]),c_0_110]),c_0_111])]) ).
cnf(c_0_118,negated_conjecture,
app(sk3,cons(sk5,sk3)) = cons(sk5,cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_64]),c_0_74])]) ).
cnf(c_0_119,negated_conjecture,
memberP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_63]),c_0_64]),c_0_47])]) ).
fof(c_0_120,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_121,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_97]),c_0_90]) ).
cnf(c_0_122,negated_conjecture,
ssList(app(sk3,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_74])]) ).
cnf(c_0_123,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_124,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| cons(sk5,cons(sk5,sk3)) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_64]),c_0_74])]) ).
cnf(c_0_125,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_120]) ).
cnf(c_0_126,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,cons(sk5,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_104]),c_0_74])]) ).
cnf(c_0_127,negated_conjecture,
ssList(cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_72]),c_0_74])]) ).
fof(c_0_128,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_129,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_123 ).
cnf(c_0_130,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,cons(sk5,sk3)) != X1
| epred2_0 ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_131,negated_conjecture,
ssList(cons(sk5,cons(sk5,sk3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_72]),c_0_74]),c_0_127])]) ).
cnf(c_0_132,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_133,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_129,c_0_128]),c_0_120]) ).
cnf(c_0_134,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_130]),c_0_131])]) ).
cnf(c_0_135,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_136,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_137,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_138,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_132 ).
cnf(c_0_139,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_128]) ).
cnf(c_0_140,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_134])]) ).
cnf(c_0_141,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_142,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_135 ).
cnf(c_0_143,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_144,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_136 ).
cnf(c_0_145,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_137 ).
cnf(c_0_146,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_147,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_138,c_0_97]) ).
cnf(c_0_148,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_149,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_141 ).
cnf(c_0_150,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_151,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_43]),c_0_44]) ).
cnf(c_0_152,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_143 ).
cnf(c_0_153,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_144,c_0_145]),c_0_47])]) ).
cnf(c_0_154,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_146 ).
cnf(c_0_155,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_156,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk3,X3)
| segmentP(app(X1,cons(sk5,X2)),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_72]),c_0_74])]) ).
cnf(c_0_157,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_109,c_0_148])]) ).
cnf(c_0_158,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_149]) ).
cnf(c_0_159,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_150 ).
cnf(c_0_160,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_47])]) ).
cnf(c_0_161,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155])])]) ).
cnf(c_0_162,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(sk3,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_156,c_0_157]),c_0_111]),c_0_110])]) ).
cnf(c_0_163,negated_conjecture,
( ~ ssList(X1)
| sk3 != X1
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_91]),c_0_47]),c_0_74])]) ).
cnf(c_0_164,negated_conjecture,
( ~ ssList(X1)
| frontsegP(cons(sk5,X1),sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_63]),c_0_64]),c_0_47])]),c_0_159]) ).
cnf(c_0_165,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
co1_14 ).
cnf(c_0_166,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_167,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ frontsegP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_74])]) ).
cnf(c_0_168,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_74])]) ).
cnf(c_0_169,negated_conjecture,
frontsegP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_63]),c_0_47])]) ).
cnf(c_0_170,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_165,c_0_55]) ).
cnf(c_0_171,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_166,c_0_44]) ).
cnf(c_0_172,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_74]),c_0_170]),c_0_171])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC078-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.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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
% 127.95/19.97 % Version: 3.5.1
% 127.95/19.97 % Preprocessing class: FSLSSMSMSSSNFFN.
% 127.95/19.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 127.95/19.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 127.95/19.97 % Starting new_bool_3 with 300s (1) cores
% 127.95/19.97 % Starting new_bool_1 with 300s (1) cores
% 127.95/19.97 % Starting sh5l with 300s (1) cores
% 127.95/19.97 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3577783 completed with status 0
% 127.95/19.97 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 127.95/19.97 % Preprocessing class: FSLSSMSMSSSNFFN.
% 127.95/19.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 127.95/19.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 127.95/19.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 127.95/19.97 % No SInE strategy applied
% 127.95/19.97 % Search class: FGHSM-FSLM21-MFFFFFNN
% 127.95/19.97 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 127.95/19.97 % Starting SubtermCWHack with 136s (1) cores
% 127.95/19.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 127.95/19.97 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 127.95/19.97 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 127.95/19.97 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 127.95/19.97 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 3577791 completed with status 0
% 127.95/19.97 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 127.95/19.97 % Preprocessing class: FSLSSMSMSSSNFFN.
% 127.95/19.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 127.95/19.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 127.95/19.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 127.95/19.97 % No SInE strategy applied
% 127.95/19.97 % Search class: FGHSM-FSLM21-MFFFFFNN
% 127.95/19.97 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 127.95/19.97 % Starting SubtermCWHack with 136s (1) cores
% 127.95/19.97 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 127.95/19.97 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 127.95/19.97 % Preprocessing time : 0.004 s
% 127.95/19.97 % Presaturation interreduction done
% 127.95/19.97
% 127.95/19.97 % Proof found!
% 127.95/19.97 % SZS status Unsatisfiable
% 127.95/19.97 % SZS output start CNFRefutation
% See solution above
% 127.95/19.97 % Parsed axioms : 199
% 127.95/19.97 % Removed by relevancy pruning/SinE : 0
% 127.95/19.97 % Initial clauses : 199
% 127.95/19.97 % Removed in clause preprocessing : 0
% 127.95/19.97 % Initial clauses in saturation : 199
% 127.95/19.97 % Processed clauses : 26290
% 127.95/19.97 % ...of these trivial : 501
% 127.95/19.97 % ...subsumed : 20563
% 127.95/19.97 % ...remaining for further processing : 5226
% 127.95/19.97 % Other redundant clauses eliminated : 5700
% 127.95/19.97 % Clauses deleted for lack of memory : 0
% 127.95/19.97 % Backward-subsumed : 593
% 127.95/19.97 % Backward-rewritten : 694
% 127.95/19.97 % Generated clauses : 502606
% 127.95/19.97 % ...of the previous two non-redundant : 475691
% 127.95/19.97 % ...aggressively subsumed : 0
% 127.95/19.97 % Contextual simplify-reflections : 1216
% 127.95/19.97 % Paramodulations : 496332
% 127.95/19.97 % Factorizations : 0
% 127.95/19.97 % NegExts : 0
% 127.95/19.97 % Equation resolutions : 6197
% 127.95/19.97 % Disequality decompositions : 0
% 127.95/19.97 % Total rewrite steps : 341493
% 127.95/19.97 % ...of those cached : 336563
% 127.95/19.97 % Propositional unsat checks : 0
% 127.95/19.97 % Propositional check models : 0
% 127.95/19.97 % Propositional check unsatisfiable : 0
% 127.95/19.97 % Propositional clauses : 0
% 127.95/19.97 % Propositional clauses after purity: 0
% 127.95/19.97 % Propositional unsat core size : 0
% 127.95/19.97 % Propositional preprocessing time : 0.000
% 127.95/19.97 % Propositional encoding time : 0.000
% 127.95/19.97 % Propositional solver time : 0.000
% 127.95/19.97 % Success case prop preproc time : 0.000
% 127.95/19.97 % Success case prop encoding time : 0.000
% 127.95/19.97 % Success case prop solver time : 0.000
% 127.95/19.97 % Current number of processed clauses : 3702
% 127.95/19.97 % Positive orientable unit clauses : 259
% 127.95/19.97 % Positive unorientable unit clauses: 0
% 127.95/19.97 % Negative unit clauses : 209
% 127.95/19.97 % Non-unit-clauses : 3234
% 127.95/19.97 % Current number of unprocessed clauses: 443047
% 127.95/19.97 % ...number of literals in the above : 3950044
% 127.95/19.97 % Current number of archived formulas : 0
% 127.95/19.97 % Current number of archived clauses : 1486
% 127.95/19.97 % Clause-clause subsumption calls (NU) : 4565891
% 127.95/19.97 % Rec. Clause-clause subsumption calls : 453813
% 127.95/19.97 % Non-unit clause-clause subsumptions : 10825
% 127.95/19.97 % Unit Clause-clause subsumption calls : 118762
% 127.95/19.97 % Rewrite failures with RHS unbound : 0
% 127.95/19.97 % BW rewrite match attempts : 447
% 127.95/19.97 % BW rewrite match successes : 149
% 127.95/19.97 % Condensation attempts : 0
% 127.95/19.97 % Condensation successes : 0
% 127.95/19.97 % Termbank termtop insertions : 14086634
% 127.95/19.97 % Search garbage collected termcells : 541
% 127.95/19.97
% 127.95/19.97 % -------------------------------------------------
% 127.95/19.97 % User time : 17.492 s
% 127.95/19.97 % System time : 0.480 s
% 127.95/19.97 % Total time : 17.972 s
% 127.95/19.97 % Maximum resident set size: 4016 pages
% 127.95/19.97
% 127.95/19.97 % -------------------------------------------------
% 127.95/19.97 % User time : 89.192 s
% 127.95/19.97 % System time : 2.757 s
% 127.95/19.97 % Total time : 91.948 s
% 127.95/19.97 % Maximum resident set size: 5120 pages
% 127.95/19.97 % E exiting
%------------------------------------------------------------------------------