%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC155-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 : n016.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:45:10 PM UTC 2026
% Result : Unsatisfiable 13.82s 2.52s
% Output : CNFRefutation 13.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 46
% Syntax : Number of clauses : 264 ( 72 unt; 20 nHn; 245 RR)
% Number of literals : 745 ( 207 equ; 482 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 335 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
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(co1_14,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_11,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_12,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_9,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(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(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_10,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_13,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause123,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause143,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause171,axiom,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| cons(X1,X2) != cons(X3,X4)
| X4 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause171) ).
cnf(co1_7,negated_conjecture,
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause175,axiom,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(co1_17,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause130,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause130) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_15,negated_conjecture,
leq(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_8,negated_conjecture,
( ~ memberP(X2,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_18,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk10,sk6)
| ~ leq(sk5,sk10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(c_0_46,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_47,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_14 ).
cnf(c_0_48,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_46 ).
cnf(c_0_49,negated_conjecture,
ssList(sk7),
co1_11 ).
cnf(c_0_50,negated_conjecture,
ssList(sk8),
co1_12 ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_51 ).
cnf(c_0_54,negated_conjecture,
ssItem(sk5),
co1_9 ).
cnf(c_0_55,axiom,
ssList(nil),
clause8 ).
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,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_56 ).
cnf(c_0_59,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_60,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk1,
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_50])]) ).
cnf(c_0_61,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_59 ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,sk8))
| app(app(sk7,app(cons(sk5,sk8),cons(sk6,nil))),sk9) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_48]),c_0_49])]) ).
cnf(c_0_64,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_62 ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,app(cons(sk5,sk8),cons(sk6,nil))),sk9) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_53]),c_0_54]),c_0_50])]) ).
cnf(c_0_67,negated_conjecture,
ssItem(sk6),
co1_10 ).
cnf(c_0_68,plain,
( ~ duplicatefreeP(app(cons(X1,X2),cons(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(cons(X1,X2),cons(X1,X3)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_55])]),c_0_53]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_72,negated_conjecture,
app(app(sk7,app(cons(sk5,sk8),cons(sk6,nil))),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_53]),c_0_67]),c_0_55])]) ).
cnf(c_0_73,negated_conjecture,
ssList(sk9),
co1_13 ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_75,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,X2)))
| ~ ssList(X2)
| ~ ssList(cons(X1,cons(X1,X2)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_58]),c_0_55])]),c_0_53]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_69 ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_70 ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_71 ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(app(cons(sk5,sk8),cons(sk6,nil)))
| app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_72]),c_0_49]),c_0_73])]) ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_74 ).
cnf(c_0_83,plain,
( ~ duplicatefreeP(cons(hd(X1),X1))
| ~ ssList(X1)
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_53]),c_0_78]) ).
cnf(c_0_84,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_79 ).
cnf(c_0_85,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_80 ).
cnf(c_0_86,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,sk8))
| app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk1 ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_89,plain,
( ~ duplicatefreeP(cons(hd(X1),app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X1)
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_82]),c_0_85]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_86 ).
cnf(c_0_91,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_87 ).
cnf(c_0_92,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_93,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_94,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_53]),c_0_54]),c_0_50])]) ).
cnf(c_0_95,plain,
( ~ duplicatefreeP(cons(X1,app(cons(X1,X3),X2)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_53]),c_0_91]) ).
cnf(c_0_96,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_92 ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_93 ).
cnf(c_0_98,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_99,negated_conjecture,
app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_53]),c_0_67]),c_0_55])]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_60]),c_0_73])]) ).
cnf(c_0_101,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,app(X3,X2))))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_102,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_97])]),c_0_55])]) ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_98 ).
cnf(c_0_104,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,app(cons(sk5,app(sk8,cons(sk6,nil))),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_96]),c_0_54]),c_0_50])]) ).
cnf(c_0_105,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_53]),c_0_67]),c_0_55])]) ).
cnf(c_0_106,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_55])]) ).
cnf(c_0_107,plain,
( ~ ssList(X3)
| ~ ssItem(X2)
| duplicatefreeP(cons(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_53]) ).
cnf(c_0_108,negated_conjecture,
app(sk7,app(cons(sk5,app(sk8,cons(sk6,nil))),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_53]),c_0_67]),c_0_55])]) ).
cnf(c_0_109,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_110,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_82]),c_0_49])]) ).
cnf(c_0_111,plain,
( ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_112,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,nil)))
| app(sk7,cons(sk5,app(app(sk8,cons(sk6,nil)),sk9))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_96]),c_0_54]),c_0_73])]) ).
cnf(c_0_113,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_109 ).
cnf(c_0_114,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_53]),c_0_54]),c_0_50])]) ).
cnf(c_0_115,plain,
( ~ ssItem(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_53]),c_0_55])]) ).
cnf(c_0_116,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,cons(sk5,app(app(sk8,cons(sk6,nil)),sk9))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_82]),c_0_50])]) ).
cnf(c_0_117,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(app(cons(sk6,nil),sk9))
| app(app(sk7,cons(sk5,sk8)),X1) != sk1
| app(cons(sk6,nil),sk9) = X1 ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_118,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_58]),c_0_67]),c_0_73])]) ).
cnf(c_0_119,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_115,c_0_67]) ).
cnf(c_0_120,negated_conjecture,
app(sk7,cons(sk5,app(app(sk8,cons(sk6,nil)),sk9))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_53]),c_0_67]),c_0_55])]) ).
cnf(c_0_121,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(app(cons(sk6,nil),sk9))
| app(cons(sk6,nil),sk9) = cons(sk6,sk9) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_122,plain,
( ~ ssList(X2)
| ssList(cons(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_119])]) ).
cnf(c_0_123,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_124,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,cons(sk5,app(sk8,app(cons(sk6,nil),sk9)))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_48]),c_0_50]),c_0_73])]) ).
cnf(c_0_125,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(app(cons(sk6,nil),sk9))
| app(cons(sk6,nil),sk9) = cons(sk6,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_73])]) ).
cnf(c_0_126,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_123 ).
cnf(c_0_127,negated_conjecture,
app(sk7,cons(sk5,app(sk8,app(cons(sk6,nil),sk9)))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_53]),c_0_67]),c_0_55])]) ).
cnf(c_0_128,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(cons(sk6,nil),sk9) = cons(sk6,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_82]),c_0_73])]) ).
cnf(c_0_129,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_126]),c_0_82]) ).
cnf(c_0_130,negated_conjecture,
app(sk7,cons(sk5,app(sk8,cons(sk6,sk9)))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_58]),c_0_67]),c_0_73])]) ).
cnf(c_0_131,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| app(cons(sk6,nil),sk9) = cons(sk6,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_122]),c_0_55])]) ).
cnf(c_0_132,negated_conjecture,
( ~ ssList(cons(sk5,app(sk8,cons(sk6,sk9))))
| frontsegP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_49])]) ).
cnf(c_0_133,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_134,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| app(cons(sk6,nil),sk9) = cons(sk6,sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_82]),c_0_49])]) ).
cnf(c_0_135,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| app(app(app(sk7,cons(sk5,nil)),sk8),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_73])]) ).
cnf(c_0_136,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,sk9)))
| frontsegP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_53]),c_0_54])]) ).
cnf(c_0_137,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_133 ).
cnf(c_0_138,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| app(cons(X1,X2),X3) = cons(X1,app(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_119])]) ).
cnf(c_0_139,negated_conjecture,
app(cons(sk6,nil),sk9) = cons(sk6,sk9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_122]),c_0_50])]) ).
cnf(c_0_140,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_141,negated_conjecture,
( ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| app(app(app(sk7,cons(sk5,nil)),sk8),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_122]),c_0_55])]) ).
cnf(c_0_142,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_143,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| frontsegP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_82]),c_0_50])]) ).
cnf(c_0_144,plain,
( ~ ssList(X2)
| tl(cons(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_119])]) ).
cnf(c_0_145,negated_conjecture,
cons(sk6,app(nil,sk9)) = cons(sk6,sk9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_73]),c_0_55])]) ).
cnf(c_0_146,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
c_0_140 ).
cnf(c_0_147,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(app(sk7,cons(sk5,nil)),sk8),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_82]),c_0_50])]) ).
cnf(c_0_148,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_142 ).
cnf(c_0_149,negated_conjecture,
frontsegP(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_53]),c_0_67]),c_0_73])]) ).
cnf(c_0_150,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_151,negated_conjecture,
( ~ ssList(app(nil,sk9))
| app(nil,sk9) = tl(cons(sk6,sk9)) ),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_152,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_146]),c_0_82]) ).
cnf(c_0_153,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,cons(sk5,nil)),sk8),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_82]),c_0_49])]) ).
cnf(c_0_154,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(sk5,app(sk8,cons(sk6,sk9))))
| app(sk7,X1) != sk1
| cons(sk5,app(sk8,cons(sk6,sk9))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_130]),c_0_49])]) ).
cnf(c_0_155,negated_conjecture,
app(sk7,skaf45(sk1,sk7)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_49]),c_0_150])]) ).
cnf(c_0_156,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_157,negated_conjecture,
tl(cons(sk6,sk9)) = sk9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_65]),c_0_73])]) ).
cnf(c_0_158,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| rearsegP(sk1,cons(sk6,sk9)) ),
inference(spm,[status(thm)],[c_0_152,c_0_118]) ).
cnf(c_0_159,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),sk8),app(cons(sk6,nil),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_122]),c_0_55])]) ).
cnf(c_0_160,negated_conjecture,
( ~ ssList(cons(sk5,app(sk8,cons(sk6,sk9))))
| cons(sk5,app(sk8,cons(sk6,sk9))) = skaf45(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_156])]) ).
cnf(c_0_161,negated_conjecture,
( ~ ssList(app(nil,sk9))
| app(nil,sk9) = sk9 ),
inference(rw,[status(thm)],[c_0_151,c_0_157]) ).
cnf(c_0_162,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| rearsegP(sk1,cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_122]),c_0_73])]) ).
cnf(c_0_163,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,app(cons(sk5,nil),sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_164,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,sk9)))
| cons(sk5,app(sk8,cons(sk6,sk9))) = skaf45(sk1,sk7) ),
inference(spm,[status(thm)],[c_0_160,c_0_122]) ).
cnf(c_0_165,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_48]),c_0_82]) ).
cnf(c_0_166,negated_conjecture,
app(nil,sk9) = sk9,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_82]),c_0_55]),c_0_73])]) ).
cnf(c_0_167,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_168,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_169,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| rearsegP(sk1,cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_82]),c_0_49])]) ).
cnf(c_0_170,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),sk8)),app(cons(sk6,nil),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_122]),c_0_55])]) ).
cnf(c_0_171,plain,
( ~ ssList(X2)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_119])]) ).
cnf(c_0_172,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| cons(sk5,app(sk8,cons(sk6,sk9))) = skaf45(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_82]),c_0_50])]) ).
cnf(c_0_173,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_73]),c_0_55])]) ).
cnf(c_0_174,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_167 ).
cnf(c_0_175,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ssList(cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_139]),c_0_73])]) ).
cnf(c_0_176,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_168 ).
cnf(c_0_177,negated_conjecture,
rearsegP(sk1,cons(sk6,sk9)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_122]),c_0_50])]) ).
cnf(c_0_178,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_73])]) ).
cnf(c_0_179,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,app(X2,X3)),X4) = app(app(X1,X2),app(X3,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_48]),c_0_82]) ).
cnf(c_0_180,plain,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| cons(X1,X2) != cons(X3,X4)
| X4 = X2 ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_181,negated_conjecture,
cons(sk5,app(sk8,cons(sk6,sk9))) = skaf45(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_122]),c_0_73])]) ).
cnf(c_0_182,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ssList(cons(X1,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_171]),c_0_73])]) ).
cnf(c_0_183,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(app(cons(sk6,nil),sk9))
| app(X1,app(cons(sk6,nil),sk9)) != sk1
| app(sk7,cons(sk5,sk8)) = X1 ),
inference(spm,[status(thm)],[c_0_174,c_0_114]) ).
cnf(c_0_184,negated_conjecture,
ssList(cons(sk6,sk9)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_175,c_0_122]),c_0_55])]) ).
cnf(c_0_185,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| app(skaf46(sk1,cons(sk6,sk9)),cons(sk6,sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_150])]) ).
cnf(c_0_186,negated_conjecture,
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X1,X4) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_187,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,sk9))
| app(app(sk7,cons(sk5,nil)),app(sk8,cons(sk6,sk9))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_178,c_0_179]),c_0_50]),c_0_49])]) ).
cnf(c_0_188,plain,
( ~ ssList(X2)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X3)
| cons(X1,X2) != cons(X3,X4)
| X4 = X2 ),
c_0_180 ).
cnf(c_0_189,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_190,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,sk9)))
| app(sk8,cons(sk6,sk9)) = tl(skaf45(sk1,sk7)) ),
inference(spm,[status(thm)],[c_0_144,c_0_181]) ).
cnf(c_0_191,negated_conjecture,
ssList(cons(X1,sk9)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_122]),c_0_55])]) ).
cnf(c_0_192,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(X1,cons(sk6,sk9)) != sk1
| app(sk7,cons(sk5,sk8)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_139]),c_0_139]),c_0_184])]) ).
cnf(c_0_193,negated_conjecture,
app(skaf46(sk1,cons(sk6,sk9)),cons(sk6,sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_184])]) ).
cnf(c_0_194,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_195,negated_conjecture,
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X1,X4) ),
c_0_186 ).
cnf(c_0_196,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_197,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,cons(sk5,nil)),app(sk8,cons(sk6,sk9))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_122]),c_0_73])]) ).
cnf(c_0_198,plain,
( ~ ssList(X2)
| cons(X1,X2) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_119])]) ).
cnf(c_0_199,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause175]) ).
cnf(c_0_200,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| cons(X3,X1) != cons(X4,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_119]),c_0_119])]) ).
cnf(c_0_201,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_189 ).
cnf(c_0_202,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_203,negated_conjecture,
app(sk8,cons(sk6,sk9)) = tl(skaf45(sk1,sk7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_82]),c_0_50]),c_0_191])]) ).
cnf(c_0_204,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| app(sk7,cons(sk5,sk8)) = skaf46(sk1,cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_194])]) ).
cnf(c_0_205,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ memberP(X4,X2)
| app(app(X3,cons(X1,nil)),X4) != sk1
| leq(X1,X2) ),
inference(rw,[status(thm)],[c_0_195,c_0_196]) ).
cnf(c_0_206,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(sk8,cons(sk6,sk9))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_197,c_0_122]),c_0_55])]) ).
cnf(c_0_207,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,sk9)))
| skaf45(sk1,sk7) != nil ),
inference(spm,[status(thm)],[c_0_198,c_0_181]) ).
cnf(c_0_208,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
c_0_199 ).
cnf(c_0_209,plain,
( ~ ssList(X2)
| skaf82(cons(X1,X2)) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_201]),c_0_202])])]),c_0_122]),c_0_198]) ).
cnf(c_0_210,negated_conjecture,
cons(sk5,tl(skaf45(sk1,sk7))) = skaf45(sk1,sk7),
inference(rw,[status(thm)],[c_0_181,c_0_203]) ).
cnf(c_0_211,negated_conjecture,
ssList(tl(skaf45(sk1,sk7))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_203]),c_0_50]),c_0_191])]) ).
cnf(c_0_212,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| app(sk7,cons(sk5,sk8)) = skaf46(sk1,cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_204,c_0_82]),c_0_49])]) ).
cnf(c_0_213,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X4)
| ~ memberP(X4,X2)
| app(app(X3,cons(X1,nil)),X4) != sk1
| leq(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_119]),c_0_119])]) ).
cnf(c_0_214,negated_conjecture,
app(app(sk7,cons(sk5,nil)),tl(skaf45(sk1,sk7))) = sk1,
inference(rw,[status(thm)],[c_0_206,c_0_203]) ).
cnf(c_0_215,negated_conjecture,
( ~ ssList(tl(skaf45(sk1,sk7)))
| skaf45(sk1,sk7) != nil ),
inference(rw,[status(thm)],[c_0_207,c_0_203]) ).
cnf(c_0_216,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssItem(X2)
| memberP(app(X1,cons(X2,X3)),X2) ),
inference(er,[status(thm)],[c_0_208]) ).
cnf(c_0_217,negated_conjecture,
tl(skaf45(sk1,sk7)) = skaf82(skaf45(sk1,sk7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_209,c_0_210]),c_0_211])]) ).
cnf(c_0_218,negated_conjecture,
app(sk7,cons(sk5,sk8)) = skaf46(sk1,cons(sk6,sk9)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_122]),c_0_50])]) ).
cnf(c_0_219,negated_conjecture,
( ~ memberP(tl(skaf45(sk1,sk7)),X1)
| leq(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_213,c_0_214]),c_0_211]),c_0_49])]) ).
cnf(c_0_220,plain,
( ~ ssList(X1)
| nil = X1
| tl(X1) = skaf82(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_201]),c_0_202])]) ).
cnf(c_0_221,negated_conjecture,
skaf45(sk1,sk7) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_211])]) ).
cnf(c_0_222,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(X1,cons(X2,X3)))
| memberP(app(X1,cons(X2,X3)),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_119])]) ).
cnf(c_0_223,negated_conjecture,
app(sk8,cons(sk6,sk9)) = skaf82(skaf45(sk1,sk7)),
inference(rw,[status(thm)],[c_0_203,c_0_217]) ).
cnf(c_0_224,negated_conjecture,
( ~ ssList(X1)
| app(X1,cons(sk6,sk9)) != sk1
| skaf46(sk1,cons(sk6,sk9)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_192,c_0_218]),c_0_218]),c_0_194])]) ).
cnf(c_0_225,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_171]),c_0_73])]) ).
cnf(c_0_226,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_227,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_228,negated_conjecture,
( ~ memberP(skaf82(skaf45(sk1,sk7)),X1)
| leq(sk5,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_156])]),c_0_221]) ).
cnf(c_0_229,negated_conjecture,
memberP(skaf82(skaf45(sk1,sk7)),sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_202]),c_0_73]),c_0_50])]) ).
cnf(c_0_230,negated_conjecture,
( ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| app(app(sk7,cons(sk5,nil)),sk8) = skaf46(sk1,cons(sk6,sk9)) ),
inference(spm,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_231,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause130]) ).
cnf(c_0_232,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_233,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_226 ).
cnf(c_0_234,negated_conjecture,
( ~ leq(sk5,sk6)
| memberP(sk8,sk10) ),
c_0_227 ).
cnf(c_0_235,negated_conjecture,
leq(sk5,sk6),
inference(spm,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_236,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),sk8) = skaf46(sk1,cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_82]),c_0_50])]) ).
cnf(c_0_237,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
c_0_231 ).
cnf(c_0_238,negated_conjecture,
leq(sk6,sk5),
co1_15 ).
cnf(c_0_239,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_232 ).
cnf(c_0_240,negated_conjecture,
( ~ memberP(X2,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X4,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_241,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ memberP(X2,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_119])]) ).
cnf(c_0_242,negated_conjecture,
memberP(sk8,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_235])]) ).
cnf(c_0_243,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,cons(sk5,nil)),sk8) = skaf46(sk1,cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_82]),c_0_49])]) ).
cnf(c_0_244,negated_conjecture,
( ~ leq(sk5,sk6)
| sk6 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_67]),c_0_54])]) ).
cnf(c_0_245,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_119])]) ).
cnf(c_0_246,negated_conjecture,
( ~ memberP(X2,X4)
| ~ ssItem(X4)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| leq(X4,X1) ),
c_0_240 ).
cnf(c_0_247,negated_conjecture,
( ~ ssList(X1)
| memberP(app(X1,sk8),sk10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_50])]) ).
cnf(c_0_248,negated_conjecture,
app(app(sk7,cons(sk5,nil)),sk8) = skaf46(sk1,cons(sk6,sk9)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_122]),c_0_55])]) ).
cnf(c_0_249,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_244,c_0_235])]) ).
cnf(c_0_250,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk10,sk6)
| ~ leq(sk5,sk10) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_251,negated_conjecture,
( ~ ssList(X1)
| memberP(app(sk8,X1),sk10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_242]),c_0_50])]) ).
cnf(c_0_252,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ memberP(X3,X1)
| app(app(X3,cons(X2,nil)),X4) != sk1
| leq(X1,X2) ),
inference(rw,[status(thm)],[c_0_246,c_0_196]) ).
cnf(c_0_253,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| memberP(skaf46(sk1,cons(sk5,sk9)),sk10) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_249]) ).
cnf(c_0_254,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ leq(sk10,sk6)
| ~ leq(sk5,sk10) ),
c_0_250 ).
cnf(c_0_255,negated_conjecture,
memberP(skaf82(skaf45(sk1,sk7)),sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_223]),c_0_191])]) ).
cnf(c_0_256,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X4)
| ~ memberP(X3,X1)
| app(app(X3,cons(X2,nil)),X4) != sk1
| leq(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_252,c_0_119]),c_0_119])]) ).
cnf(c_0_257,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| memberP(skaf46(sk1,cons(sk5,sk9)),sk10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_82]),c_0_49])]) ).
cnf(c_0_258,negated_conjecture,
( ~ leq(sk10,sk5)
| ~ leq(sk5,sk10) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_254,c_0_235])]),c_0_249]) ).
cnf(c_0_259,negated_conjecture,
leq(sk5,sk10),
inference(spm,[status(thm)],[c_0_228,c_0_255]) ).
cnf(c_0_260,negated_conjecture,
( ~ memberP(skaf46(sk1,cons(sk5,sk9)),X1)
| leq(X1,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_47]),c_0_73])]),c_0_249]),c_0_248]),c_0_249]),c_0_248]),c_0_249]),c_0_194])]) ).
cnf(c_0_261,negated_conjecture,
memberP(skaf46(sk1,cons(sk5,sk9)),sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_122]),c_0_55])]) ).
cnf(c_0_262,negated_conjecture,
~ leq(sk10,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_258,c_0_259])]) ).
cnf(c_0_263,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_260,c_0_261]),c_0_262]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC155-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.09/0.45 % Computer : n016.cluster.edu
% 0.09/0.45 % Model : x86_64 x86_64
% 0.09/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.45 % Memory : 8046.5625MB
% 0.09/0.45 % OS : Linux 6.8.0-71-generic
% 0.09/0.45 % CPULimit : 300
% 0.09/0.45 % WCLimit : 300
% 0.09/0.45 % DateTime : Mon Sep 21 08:04:24 UTC 2026
% 0.09/0.45 % CPUTime :
% 0.09/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.50 Running first-order theorem proving
% 0.15/0.50 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
% 13.82/2.52 % Version: 3.5.1
% 13.82/2.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 13.82/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.82/2.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.82/2.52 % Starting new_bool_3 with 300s (1) cores
% 13.82/2.52 % Starting new_bool_1 with 300s (1) cores
% 13.82/2.52 % Starting sh5l with 300s (1) cores
% 13.82/2.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1967699 completed with status 0
% 13.82/2.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 13.82/2.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 13.82/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.82/2.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.82/2.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.82/2.52 % No SInE strategy applied
% 13.82/2.52 % Search class: FGHSM-FSLM21-MFFFFFNN
% 13.82/2.52 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 13.82/2.52 % Starting SubtermCWHack with 136s (1) cores
% 13.82/2.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 13.82/2.52 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 13.82/2.52 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 13.82/2.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 13.82/2.52 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1967708 completed with status 0
% 13.82/2.52 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 13.82/2.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 13.82/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.82/2.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.82/2.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.82/2.52 % No SInE strategy applied
% 13.82/2.52 % Search class: FGHSM-FSLM21-MFFFFFNN
% 13.82/2.52 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 13.82/2.52 % Starting SubtermCWHack with 136s (1) cores
% 13.82/2.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 13.82/2.52 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 13.82/2.52 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 13.82/2.52 % Preprocessing time : 0.004 s
% 13.82/2.52
% 13.82/2.52 % Proof found!
% 13.82/2.52 % SZS status Unsatisfiable
% 13.82/2.52 % SZS output start CNFRefutation
% See solution above
% 13.82/2.52 % Parsed axioms : 203
% 13.82/2.52 % Removed by relevancy pruning/SinE : 0
% 13.82/2.52 % Initial clauses : 203
% 13.82/2.52 % Removed in clause preprocessing : 0
% 13.82/2.52 % Initial clauses in saturation : 203
% 13.82/2.52 % Processed clauses : 9495
% 13.82/2.52 % ...of these trivial : 397
% 13.82/2.52 % ...subsumed : 5275
% 13.82/2.52 % ...remaining for further processing : 3823
% 13.82/2.52 % Other redundant clauses eliminated : 157
% 13.82/2.52 % Clauses deleted for lack of memory : 0
% 13.82/2.52 % Backward-subsumed : 489
% 13.82/2.52 % Backward-rewritten : 894
% 13.82/2.52 % Generated clauses : 45064
% 13.82/2.52 % ...of the previous two non-redundant : 42108
% 13.82/2.52 % ...aggressively subsumed : 0
% 13.82/2.52 % Contextual simplify-reflections : 264
% 13.82/2.52 % Paramodulations : 44884
% 13.82/2.52 % Factorizations : 0
% 13.82/2.52 % NegExts : 0
% 13.82/2.52 % Equation resolutions : 167
% 13.82/2.52 % Disequality decompositions : 0
% 13.82/2.52 % Total rewrite steps : 65133
% 13.82/2.52 % ...of those cached : 64023
% 13.82/2.52 % Propositional unsat checks : 0
% 13.82/2.52 % Propositional check models : 0
% 13.82/2.52 % Propositional check unsatisfiable : 0
% 13.82/2.52 % Propositional clauses : 0
% 13.82/2.52 % Propositional clauses after purity: 0
% 13.82/2.52 % Propositional unsat core size : 0
% 13.82/2.52 % Propositional preprocessing time : 0.000
% 13.82/2.52 % Propositional encoding time : 0.000
% 13.82/2.52 % Propositional solver time : 0.000
% 13.82/2.52 % Success case prop preproc time : 0.000
% 13.82/2.52 % Success case prop encoding time : 0.000
% 13.82/2.52 % Success case prop solver time : 0.000
% 13.82/2.52 % Current number of processed clauses : 2403
% 13.82/2.52 % Positive orientable unit clauses : 354
% 13.82/2.52 % Positive unorientable unit clauses: 0
% 13.82/2.52 % Negative unit clauses : 130
% 13.82/2.52 % Non-unit-clauses : 1919
% 13.82/2.52 % Current number of unprocessed clauses: 31305
% 13.82/2.52 % ...number of literals in the above : 152607
% 13.82/2.52 % Current number of archived formulas : 0
% 13.82/2.52 % Current number of archived clauses : 1397
% 13.82/2.52 % Clause-clause subsumption calls (NU) : 1239070
% 13.82/2.52 % Rec. Clause-clause subsumption calls : 734673
% 13.82/2.52 % Non-unit clause-clause subsumptions : 4493
% 13.82/2.52 % Unit Clause-clause subsumption calls : 49941
% 13.82/2.52 % Rewrite failures with RHS unbound : 0
% 13.82/2.52 % BW rewrite match attempts : 771
% 13.82/2.52 % BW rewrite match successes : 215
% 13.82/2.52 % Condensation attempts : 0
% 13.82/2.52 % Condensation successes : 0
% 13.82/2.52 % Termbank termtop insertions : 1256056
% 13.82/2.52 % Search garbage collected termcells : 555
% 13.82/2.52
% 13.82/2.52 % -------------------------------------------------
% 13.82/2.52 % User time : 1.901 s
% 13.82/2.52 % System time : 0.051 s
% 13.82/2.52 % Total time : 1.952 s
% 13.82/2.52 % Maximum resident set size: 3816 pages
% 13.82/2.52
% 13.82/2.52 % -------------------------------------------------
% 13.82/2.52 % User time : 9.492 s
% 13.82/2.52 % System time : 0.323 s
% 13.82/2.52 % Total time : 9.815 s
% 13.82/2.52 % Maximum resident set size: 4864 pages
% 13.82/2.52 % E exiting
%------------------------------------------------------------------------------