%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC390-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 : n013.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:12 PM UTC 2026
% Result : Unsatisfiable 168.58s 30.34s
% Output : CNFRefutation 168.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 38
% Syntax : Number of formulae : 174 ( 39 unt; 0 def)
% Number of atoms : 471 ( 120 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 593 ( 296 ~; 295 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 219 ( 15 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
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(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
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(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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/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/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(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(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
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(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(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_12,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_37,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(sk2,sk1)
| neq(sk2,nil) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_42,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(sk4,sk1)
| neq(sk4,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_43 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_44 ).
cnf(c_0_51,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_41]) ).
cnf(c_0_52,axiom,
ssList(nil),
clause8 ).
cnf(c_0_53,negated_conjecture,
( ~ segmentP(sk4,sk1)
| cons(sk5,nil) = sk1 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( sk4 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_56,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ssItem(sk5) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(sk5)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_59,negated_conjecture,
( ~ segmentP(sk4,nil)
| sk4 != nil
| cons(sk5,nil) = nil ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
( ~ segmentP(sk4,nil)
| ssItem(sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_54]),c_0_57]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_58 ).
cnf(c_0_63,negated_conjecture,
( sk4 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_51])]) ).
cnf(c_0_64,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_60]),c_0_51])]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_66,negated_conjecture,
( sk4 = nil
| cons(sk5,nil) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_67,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_52])]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_70,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_65 ).
cnf(c_0_71,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_68 ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_75,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_69 ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_64])]) ).
cnf(c_0_78,negated_conjecture,
tl(sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_71]),c_0_64]),c_0_52])]) ).
cnf(c_0_79,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_80,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_71]),c_0_64]),c_0_52])]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_73 ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_74 ).
cnf(c_0_83,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_75 ).
cnf(c_0_84,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_85,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_76,c_0_77]),c_0_78]),c_0_79])]),c_0_80]) ).
cnf(c_0_86,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_81,c_0_82]),c_0_83]),c_0_62]) ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_88,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_84 ).
cnf(c_0_89,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_71]),c_0_78]),c_0_52])]) ).
cnf(c_0_90,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_86,c_0_85]),c_0_64])]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_87 ).
cnf(c_0_92,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_93,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_88,c_0_89]),c_0_52])]) ).
cnf(c_0_94,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_90,c_0_91]),c_0_71]),c_0_52])]) ).
cnf(c_0_95,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_92 ).
cnf(c_0_96,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_64]),c_0_52])]) ).
cnf(c_0_97,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_72,c_0_88]),c_0_95]) ).
cnf(c_0_98,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_88,c_0_96]),c_0_52]),c_0_79])]) ).
cnf(c_0_99,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_97,c_0_98]),c_0_96]),c_0_52]),c_0_79])]) ).
cnf(c_0_100,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_101,negated_conjecture,
app(nil,sk1) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_99]),c_0_79]),c_0_64])]) ).
cnf(c_0_102,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_105,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_100 ).
cnf(c_0_106,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_88,c_0_101]),c_0_79]),c_0_52])]) ).
cnf(c_0_107,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_102 ).
cnf(c_0_108,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_88]),c_0_95]) ).
cnf(c_0_109,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_103 ).
cnf(c_0_110,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_111,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_104 ).
cnf(c_0_112,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_113,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_114,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(sk1,app(X1,X2)) = app(cons(sk5,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_77]),c_0_79])]) ).
cnf(c_0_115,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_106,c_0_94]),c_0_64]),c_0_52])]) ).
cnf(c_0_116,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_107]) ).
cnf(c_0_117,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_108,c_0_98]),c_0_52]),c_0_79])]) ).
cnf(c_0_118,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_70,c_0_109]),c_0_110])]) ).
cnf(c_0_119,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_111]) ).
cnf(c_0_120,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_112 ).
cnf(c_0_121,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_113 ).
cnf(c_0_122,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_123,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_124,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,sk1),X2) = cons(X1,cons(sk5,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_77]),c_0_79])]) ).
cnf(c_0_125,negated_conjecture,
app(cons(sk5,sk1),sk1) = app(sk1,cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_79])]) ).
cnf(c_0_126,negated_conjecture,
( memberP(sk1,sk5)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_66]),c_0_64]),c_0_52])]) ).
cnf(c_0_127,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_117,c_0_118]),c_0_110]),c_0_79])]) ).
cnf(c_0_128,negated_conjecture,
singletonP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_71]),c_0_64]),c_0_79])]) ).
cnf(c_0_129,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_120,c_0_121]),c_0_122]),c_0_123])]) ).
cnf(c_0_130,negated_conjecture,
app(sk1,cons(sk5,sk1)) = cons(sk5,cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_64]),c_0_79])]) ).
cnf(c_0_131,negated_conjecture,
memberP(sk1,sk5),
inference(sr,[status(thm)],[c_0_126,c_0_67]) ).
fof(c_0_132,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_133,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_105]),c_0_95]) ).
cnf(c_0_134,negated_conjecture,
ssList(app(sk1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_79])]) ).
cnf(c_0_135,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_136,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_129,c_0_130]),c_0_131]),c_0_64]),c_0_79])]) ).
cnf(c_0_137,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_132]) ).
cnf(c_0_138,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,cons(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_115]),c_0_79])]) ).
cnf(c_0_139,negated_conjecture,
ssList(cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_77]),c_0_79])]) ).
fof(c_0_140,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_141,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_135 ).
cnf(c_0_142,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,cons(sk5,sk1)) != X1
| epred2_0 ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_143,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_138,c_0_77]),c_0_79]),c_0_139])]) ).
cnf(c_0_144,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_145,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_141,c_0_140]),c_0_132]) ).
cnf(c_0_146,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_142]),c_0_143])]) ).
cnf(c_0_147,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_144 ).
cnf(c_0_148,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_140]) ).
cnf(c_0_149,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_146])]) ).
cnf(c_0_150,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_151,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_152,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_153,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_154,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_147,c_0_105]) ).
cnf(c_0_155,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_156,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_150 ).
cnf(c_0_157,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_151 ).
cnf(c_0_158,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
c_0_152 ).
cnf(c_0_159,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_153 ).
cnf(c_0_160,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_154,c_0_77]),c_0_79])]) ).
cnf(c_0_161,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_121,c_0_155])]) ).
cnf(c_0_162,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_156,c_0_157]),c_0_52])]) ).
cnf(c_0_163,negated_conjecture,
( ~ segmentP(sk4,sk1)
| memberP(sk4,sk5) ),
inference(spm,[status(thm)],[c_0_158,c_0_47]) ).
cnf(c_0_164,negated_conjecture,
( memberP(sk4,sk5)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_165,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_159,c_0_41]) ).
cnf(c_0_166,negated_conjecture,
( ~ ssList(X1)
| sk1 != X1
| singletonP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_71]),c_0_64])]) ).
cnf(c_0_167,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_160,c_0_161]),c_0_123]),c_0_122])]) ).
cnf(c_0_168,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_162,c_0_96]),c_0_52]),c_0_79])]) ).
cnf(c_0_169,negated_conjecture,
( ~ segmentP(sk4,nil)
| memberP(sk4,sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_54]),c_0_164]) ).
cnf(c_0_170,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_79])]) ).
cnf(c_0_171,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_79])]) ).
cnf(c_0_172,negated_conjecture,
memberP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_60]),c_0_51])]) ).
cnf(c_0_173,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC390-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.66 % Computer : n013.cluster.edu
% 0.18/5.66 % Model : x86_64 x86_64
% 0.18/5.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.66 % Memory : 8046.5625MB
% 0.18/5.66 % OS : Linux 6.8.0-71-generic
% 0.18/5.66 % CPULimit : 300
% 0.18/5.66 % WCLimit : 300
% 0.18/5.66 % DateTime : Mon Sep 21 08:20:29 UTC 2026
% 0.18/5.67 % CPUTime :
% 0.18/5.67 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.73 Running first-order theorem proving
% 0.24/5.73 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
% 168.58/30.34 % Version: 3.5.1
% 168.58/30.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 168.58/30.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 168.58/30.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 168.58/30.34 % Starting new_bool_3 with 300s (1) cores
% 168.58/30.34 % Starting new_bool_1 with 300s (1) cores
% 168.58/30.34 % Starting sh5l with 300s (1) cores
% 168.58/30.34 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 347092 completed with status 0
% 168.58/30.34 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 168.58/30.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 168.58/30.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 168.58/30.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 168.58/30.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 168.58/30.34 % No SInE strategy applied
% 168.58/30.34 % Search class: FGHSM-FSLM21-MFFFFFNN
% 168.58/30.34 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 168.58/30.34 % Starting SubtermCWHack with 136s (1) cores
% 168.58/30.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 168.58/30.34 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 168.58/30.34 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 168.58/30.34 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 168.58/30.34 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 347100 completed with status 0
% 168.58/30.34 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 168.58/30.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 168.58/30.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 168.58/30.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 168.58/30.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 168.58/30.34 % No SInE strategy applied
% 168.58/30.34 % Search class: FGHSM-FSLM21-MFFFFFNN
% 168.58/30.34 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 168.58/30.34 % Starting SubtermCWHack with 136s (1) cores
% 168.58/30.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 168.58/30.34 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 168.58/30.34 % Preprocessing time : 0.006 s
% 168.58/30.34 % Presaturation interreduction done
% 168.58/30.34
% 168.58/30.34 % Proof found!
% 168.58/30.34 % SZS status Unsatisfiable
% 168.58/30.34 % SZS output start CNFRefutation
% See solution above
% 168.58/30.35 % Parsed axioms : 197
% 168.58/30.35 % Removed by relevancy pruning/SinE : 0
% 168.58/30.35 % Initial clauses : 197
% 168.58/30.35 % Removed in clause preprocessing : 0
% 168.58/30.35 % Initial clauses in saturation : 197
% 168.58/30.35 % Processed clauses : 27394
% 168.58/30.35 % ...of these trivial : 531
% 168.58/30.35 % ...subsumed : 21470
% 168.58/30.35 % ...remaining for further processing : 5393
% 168.58/30.35 % Other redundant clauses eliminated : 6389
% 168.58/30.35 % Clauses deleted for lack of memory : 0
% 168.58/30.35 % Backward-subsumed : 645
% 168.58/30.35 % Backward-rewritten : 778
% 168.58/30.35 % Generated clauses : 550963
% 168.58/30.35 % ...of the previous two non-redundant : 521627
% 168.58/30.35 % ...aggressively subsumed : 0
% 168.58/30.35 % Contextual simplify-reflections : 1284
% 168.58/30.35 % Paramodulations : 543955
% 168.58/30.35 % Factorizations : 0
% 168.58/30.35 % NegExts : 0
% 168.58/30.35 % Equation resolutions : 6929
% 168.58/30.35 % Disequality decompositions : 0
% 168.58/30.35 % Total rewrite steps : 365813
% 168.58/30.35 % ...of those cached : 360663
% 168.58/30.35 % Propositional unsat checks : 0
% 168.58/30.35 % Propositional check models : 0
% 168.58/30.35 % Propositional check unsatisfiable : 0
% 168.58/30.35 % Propositional clauses : 0
% 168.58/30.35 % Propositional clauses after purity: 0
% 168.58/30.35 % Propositional unsat core size : 0
% 168.58/30.35 % Propositional preprocessing time : 0.000
% 168.58/30.35 % Propositional encoding time : 0.000
% 168.58/30.35 % Propositional solver time : 0.000
% 168.58/30.35 % Success case prop preproc time : 0.000
% 168.58/30.35 % Success case prop encoding time : 0.000
% 168.58/30.35 % Success case prop solver time : 0.000
% 168.58/30.35 % Current number of processed clauses : 3734
% 168.58/30.35 % Positive orientable unit clauses : 253
% 168.58/30.35 % Positive unorientable unit clauses: 0
% 168.58/30.35 % Negative unit clauses : 194
% 168.58/30.35 % Non-unit-clauses : 3287
% 168.58/30.35 % Current number of unprocessed clauses: 489020
% 168.58/30.35 % ...number of literals in the above : 4351702
% 168.58/30.35 % Current number of archived formulas : 0
% 168.58/30.35 % Current number of archived clauses : 1619
% 168.58/30.35 % Clause-clause subsumption calls (NU) : 3146849
% 168.58/30.35 % Rec. Clause-clause subsumption calls : 339317
% 168.58/30.35 % Non-unit clause-clause subsumptions : 11862
% 168.58/30.35 % Unit Clause-clause subsumption calls : 76242
% 168.58/30.35 % Rewrite failures with RHS unbound : 0
% 168.58/30.35 % BW rewrite match attempts : 473
% 168.58/30.35 % BW rewrite match successes : 152
% 168.58/30.35 % Condensation attempts : 0
% 168.58/30.35 % Condensation successes : 0
% 168.58/30.35 % Termbank termtop insertions : 15279944
% 168.58/30.35 % Search garbage collected termcells : 541
% 168.58/30.35
% 168.58/30.35 % -------------------------------------------------
% 168.58/30.35 % User time : 23.468 s
% 168.58/30.35 % System time : 0.612 s
% 168.58/30.35 % Total time : 24.080 s
% 168.58/30.35 % Maximum resident set size: 3812 pages
% 168.58/30.35
% 168.58/30.35 % -------------------------------------------------
% 168.58/30.35 % User time : 116.305 s
% 168.58/30.35 % System time : 3.428 s
% 168.58/30.35 % Total time : 119.733 s
% 168.58/30.35 % Maximum resident set size: 4864 pages
% 168.58/30.35 % E exiting
%------------------------------------------------------------------------------