TSTP Solution File: SWC162-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC162-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:48 EDT 2023
% Result : Unsatisfiable 0.15s 0.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 32
% Syntax : Number of clauses : 114 ( 45 unt; 11 nHn; 112 RR)
% Number of literals : 272 ( 64 equ; 151 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 97 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_13) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause149) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_10) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_11) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause120) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_9) ).
cnf(co1_12,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_12) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause85) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause157) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_5) ).
cnf(clause182,axiom,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause182) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_1) ).
cnf(clause67,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause67) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause47) ).
cnf(co1_18,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_18) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause100) ).
cnf(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause175) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_7) ).
cnf(clause130,axiom,
( X2 = X1
| ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause130) ).
cnf(co1_14,negated_conjecture,
leq(sk6,sk5),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',co1_14) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause56) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause181) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause71) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause66) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p',clause63) ).
cnf(c_0_32,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_13 ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_36,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_37,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_38,negated_conjecture,
( app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_39,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_40,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,negated_conjecture,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_43,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_44,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_40]),c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
( app(app(sk7,app(cons(sk5,sk8),cons(sk6,nil))),sk9) = sk3
| ~ ssList(cons(sk5,sk8))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_36])]) ).
cnf(c_0_46,negated_conjecture,
( app(app(sk7,app(cons(sk5,sk8),cons(sk6,nil))),sk9) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_40]),c_0_37])]) ).
cnf(c_0_47,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_48,negated_conjecture,
app(app(sk7,app(cons(sk5,sk8),cons(sk6,nil))),sk9) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_39]),c_0_47]),c_0_41])]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk9),
co1_12 ).
cnf(c_0_50,negated_conjecture,
( app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk3
| ~ ssList(app(cons(sk5,sk8),cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_48]),c_0_36]),c_0_49])]) ).
cnf(c_0_51,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_52,negated_conjecture,
( app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk3
| ~ ssList(cons(sk5,sk8))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_39]),c_0_40]),c_0_37])]) ).
cnf(c_0_54,negated_conjecture,
app(sk7,app(app(cons(sk5,sk8),cons(sk6,nil)),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_39]),c_0_47]),c_0_41])]) ).
cnf(c_0_55,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_56,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_44]),c_0_49])]) ).
cnf(c_0_57,negated_conjecture,
( app(sk7,app(cons(sk5,app(sk8,cons(sk6,nil))),sk9)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_40]),c_0_37])]) ).
cnf(c_0_58,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_39]),c_0_47]),c_0_41])]) ).
cnf(c_0_59,negated_conjecture,
app(sk7,app(cons(sk5,app(sk8,cons(sk6,nil))),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_39]),c_0_47]),c_0_41])]) ).
cnf(c_0_60,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(cons(sk5,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_51]),c_0_36])]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_62,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_63,negated_conjecture,
( app(sk7,cons(sk5,app(app(sk8,cons(sk6,nil)),sk9))) = sk3
| ~ ssList(app(sk8,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_55]),c_0_40]),c_0_49])]) ).
cnf(c_0_64,axiom,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
clause182 ).
cnf(c_0_65,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_39]),c_0_40]),c_0_37])]) ).
cnf(c_0_66,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_67,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause67 ).
cnf(c_0_68,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_69,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_70,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_71,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_72,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_73,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_74,negated_conjecture,
( app(sk7,cons(sk5,app(app(sk8,cons(sk6,nil)),sk9))) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_51]),c_0_37])]) ).
cnf(c_0_75,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_76,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_43]),c_0_47]),c_0_49])]) ).
cnf(c_0_77,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_66,c_0_33]) ).
cnf(c_0_78,plain,
( totalorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_79,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_41])]) ).
cnf(c_0_80,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_73]) ).
cnf(c_0_81,negated_conjecture,
app(sk7,cons(sk5,app(app(sk8,cons(sk6,nil)),sk9))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_39]),c_0_47]),c_0_41])]) ).
cnf(c_0_82,negated_conjecture,
( leq(sk5,sk6)
| ~ totalorderedP(sk3) ),
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(spm,[status(thm)],[c_0_75,c_0_76]),c_0_47]),c_0_40]),c_0_77]),c_0_49]),c_0_37]),c_0_36])]) ).
cnf(c_0_83,negated_conjecture,
( sk4 = nil
| totalorderedP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_77])]) ).
cnf(c_0_84,negated_conjecture,
( memberP(sk3,sk5)
| ~ ssList(app(app(sk8,cons(sk6,nil)),sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_40]),c_0_77]),c_0_36])]) ).
cnf(c_0_85,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause127 ).
cnf(c_0_86,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_87,axiom,
( X2 = X1
| ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause130 ).
cnf(c_0_88,negated_conjecture,
( sk4 = nil
| leq(sk5,sk6) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,negated_conjecture,
leq(sk6,sk5),
co1_14 ).
cnf(c_0_90,negated_conjecture,
( memberP(sk3,sk5)
| ~ ssList(app(sk8,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_51]),c_0_49])]) ).
cnf(c_0_91,negated_conjecture,
( sk3 = sk4
| ~ segmentP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_72]),c_0_77])]) ).
cnf(c_0_92,negated_conjecture,
( sk4 = nil
| sk6 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_40]),c_0_47])]) ).
cnf(c_0_93,negated_conjecture,
( memberP(sk3,sk5)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_51]),c_0_37])]) ).
cnf(c_0_94,negated_conjecture,
( sk6 = sk5
| sk3 = nil
| ~ segmentP(sk3,nil) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_96,negated_conjecture,
memberP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_39]),c_0_47]),c_0_41])]) ).
cnf(c_0_97,negated_conjecture,
( sk3 = nil
| sk6 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_77])]) ).
cnf(c_0_98,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
clause181 ).
cnf(c_0_99,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_100,negated_conjecture,
( sk6 = sk5
| memberP(nil,sk5) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_101,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause66 ).
cnf(c_0_102,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_98]) ).
cnf(c_0_103,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_40])]) ).
cnf(c_0_104,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_68]),c_0_69])]) ).
cnf(c_0_105,negated_conjecture,
( lt(sk5,sk5)
| ~ strictorderedP(sk3) ),
inference(rw,[status(thm)],[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(spm,[status(thm)],[c_0_102,c_0_76]),c_0_47]),c_0_40]),c_0_77]),c_0_49]),c_0_37]),c_0_36])]),c_0_103]) ).
cnf(c_0_106,negated_conjecture,
( sk4 = nil
| strictorderedP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_79]),c_0_77])]) ).
cnf(c_0_107,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
clause63 ).
cnf(c_0_108,negated_conjecture,
( sk4 = nil
| lt(sk5,sk5) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_109,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_40])]) ).
cnf(c_0_110,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_109]),c_0_109]) ).
cnf(c_0_111,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_95]),c_0_77])]) ).
cnf(c_0_112,negated_conjecture,
memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_96,c_0_111]) ).
cnf(c_0_113,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_112]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC162-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 01:16:45 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.AxFxmLLGKQ/E---3.1_21817.p
% 0.15/0.50 # Version: 3.1pre001
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 # Starting sh5l with 300s (1) cores
% 0.15/0.50 # sh5l with pid 21897 completed with status 0
% 0.15/0.50 # Result found by sh5l
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 # Starting sh5l with 300s (1) cores
% 0.15/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.50 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.50 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.15/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 21905 completed with status 0
% 0.15/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.15/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 # Starting sh5l with 300s (1) cores
% 0.15/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.50 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.50 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.15/0.50 # Preprocessing time : 0.003 s
% 0.15/0.50 # Presaturation interreduction done
% 0.15/0.50
% 0.15/0.50 # Proof found!
% 0.15/0.50 # SZS status Unsatisfiable
% 0.15/0.50 # SZS output start CNFRefutation
% See solution above
% 0.15/0.50 # Parsed axioms : 203
% 0.15/0.50 # Removed by relevancy pruning/SinE : 26
% 0.15/0.50 # Initial clauses : 177
% 0.15/0.50 # Removed in clause preprocessing : 0
% 0.15/0.50 # Initial clauses in saturation : 177
% 0.15/0.50 # Processed clauses : 755
% 0.15/0.50 # ...of these trivial : 12
% 0.15/0.50 # ...subsumed : 181
% 0.15/0.50 # ...remaining for further processing : 562
% 0.15/0.50 # Other redundant clauses eliminated : 60
% 0.15/0.50 # Clauses deleted for lack of memory : 0
% 0.15/0.50 # Backward-subsumed : 24
% 0.15/0.50 # Backward-rewritten : 130
% 0.15/0.50 # Generated clauses : 1558
% 0.15/0.50 # ...of the previous two non-redundant : 1446
% 0.15/0.50 # ...aggressively subsumed : 0
% 0.15/0.50 # Contextual simplify-reflections : 26
% 0.15/0.50 # Paramodulations : 1494
% 0.15/0.50 # Factorizations : 0
% 0.15/0.50 # NegExts : 0
% 0.15/0.50 # Equation resolutions : 65
% 0.15/0.50 # Total rewrite steps : 1598
% 0.15/0.50 # Propositional unsat checks : 0
% 0.15/0.50 # Propositional check models : 0
% 0.15/0.50 # Propositional check unsatisfiable : 0
% 0.15/0.50 # Propositional clauses : 0
% 0.15/0.50 # Propositional clauses after purity: 0
% 0.15/0.50 # Propositional unsat core size : 0
% 0.15/0.50 # Propositional preprocessing time : 0.000
% 0.15/0.50 # Propositional encoding time : 0.000
% 0.15/0.50 # Propositional solver time : 0.000
% 0.15/0.50 # Success case prop preproc time : 0.000
% 0.15/0.50 # Success case prop encoding time : 0.000
% 0.15/0.50 # Success case prop solver time : 0.000
% 0.15/0.50 # Current number of processed clauses : 218
% 0.15/0.50 # Positive orientable unit clauses : 56
% 0.15/0.50 # Positive unorientable unit clauses: 0
% 0.15/0.50 # Negative unit clauses : 1
% 0.15/0.50 # Non-unit-clauses : 161
% 0.15/0.50 # Current number of unprocessed clauses: 1019
% 0.15/0.50 # ...number of literals in the above : 4994
% 0.15/0.50 # Current number of archived formulas : 0
% 0.15/0.50 # Current number of archived clauses : 323
% 0.15/0.50 # Clause-clause subsumption calls (NU) : 17544
% 0.15/0.50 # Rec. Clause-clause subsumption calls : 4966
% 0.15/0.50 # Non-unit clause-clause subsumptions : 209
% 0.15/0.50 # Unit Clause-clause subsumption calls : 591
% 0.15/0.50 # Rewrite failures with RHS unbound : 0
% 0.15/0.50 # BW rewrite match attempts : 41
% 0.15/0.50 # BW rewrite match successes : 22
% 0.15/0.50 # Condensation attempts : 0
% 0.15/0.50 # Condensation successes : 0
% 0.15/0.50 # Termbank termtop insertions : 36593
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.063 s
% 0.15/0.50 # System time : 0.003 s
% 0.15/0.50 # Total time : 0.066 s
% 0.15/0.50 # Maximum resident set size: 2316 pages
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.067 s
% 0.15/0.50 # System time : 0.004 s
% 0.15/0.50 # Total time : 0.071 s
% 0.15/0.50 # Maximum resident set size: 1852 pages
% 0.15/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------