TSTP Solution File: SWC341-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC341-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:25:52 EDT 2024
% Result : Unsatisfiable 248.99s 32.06s
% Output : CNFRefutation 248.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 34
% Syntax : Number of clauses : 145 ( 39 unt; 13 nHn; 131 RR)
% Number of literals : 400 ( 88 equ; 257 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 201 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause129,axiom,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause129) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause67,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause67) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(co1_10,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(c_0_34,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_35,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_36,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_38,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_40,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_41,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ totalorderedP(sk1) ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_44,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
c_0_40 ).
cnf(c_0_47,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_48,negated_conjecture,
( sk4 != nil
| ~ segmentP(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_49,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_50,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_52,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_53,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_54,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_55,negated_conjecture,
( cons(sk5,nil) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_56,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_57,axiom,
ssList(nil),
clause8 ).
cnf(c_0_58,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_59,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_51 ).
cnf(c_0_60,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_52 ).
cnf(c_0_61,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_53 ).
cnf(c_0_62,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_54 ).
cnf(c_0_63,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_50]),c_0_57])]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_56]),c_0_50]),c_0_57])]),c_0_58]) ).
cnf(c_0_65,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_66,plain,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause129]) ).
cnf(c_0_67,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_60]),c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( app(sk1,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_70,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_65 ).
cnf(c_0_71,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_72,plain,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_66 ).
cnf(c_0_73,negated_conjecture,
( frontsegP(cons(sk5,X1),sk1)
| ~ 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_74,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_68]),c_0_69])]) ).
cnf(c_0_75,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_76,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_71 ).
cnf(c_0_77,negated_conjecture,
( cons(sk5,X1) = sk1
| ~ frontsegP(sk1,cons(sk5,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_69])]),c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( frontsegP(sk1,cons(sk5,X1))
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_63]),c_0_64]),c_0_57])]) ).
cnf(c_0_79,plain,
( X1 = X2
| cons(X3,X1) != app(cons(X3,nil),X2)
| ~ ssItem(X3)
| ~ ssList(cons(X3,nil))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_62]) ).
cnf(c_0_80,negated_conjecture,
( cons(sk5,X1) = sk1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_82,negated_conjecture,
( X1 = X2
| app(sk1,X2) != sk1
| ~ frontsegP(nil,X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_63]),c_0_64]),c_0_63]),c_0_69])]) ).
cnf(c_0_83,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_81 ).
cnf(c_0_84,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_85,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_86,negated_conjecture,
( nil = X1
| app(sk1,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_57])]) ).
cnf(c_0_87,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_84 ).
cnf(c_0_88,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_89,negated_conjecture,
frontsegP(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_63]),c_0_57])]) ).
cnf(c_0_90,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_85 ).
cnf(c_0_91,negated_conjecture,
skaf45(sk1,sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_69])])]),c_0_89]),c_0_69])]) ).
cnf(c_0_92,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_90]),c_0_61]) ).
cnf(c_0_93,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_91]),c_0_89]),c_0_69])]) ).
cnf(c_0_94,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_95,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_96,negated_conjecture,
( app(sk1,app(X1,X2)) = app(cons(sk5,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_68]),c_0_69])]) ).
cnf(c_0_97,negated_conjecture,
( ssList(app(X1,sk1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_57]),c_0_69])]) ).
cnf(c_0_98,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_99,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_94 ).
cnf(c_0_100,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_95 ).
cnf(c_0_101,negated_conjecture,
app(cons(sk5,sk1),nil) = app(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_93]),c_0_69]),c_0_57])]) ).
cnf(c_0_102,negated_conjecture,
ssList(cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_68]),c_0_69])]) ).
cnf(c_0_103,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_104,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_105,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_98 ).
cnf(c_0_106,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_99]),c_0_57])]) ).
cnf(c_0_107,negated_conjecture,
app(sk1,sk1) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]) ).
cnf(c_0_108,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_103 ).
cnf(c_0_109,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_104 ).
cnf(c_0_110,negated_conjecture,
( cons(sk5,app(nil,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_63]),c_0_64]),c_0_57])]) ).
cnf(c_0_111,negated_conjecture,
app(nil,cons(sk5,sk1)) = cons(sk5,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_69])]) ).
cnf(c_0_112,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_113,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_108,c_0_74]) ).
cnf(c_0_114,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_109]) ).
cnf(c_0_115,negated_conjecture,
app(sk1,cons(sk5,sk1)) = cons(sk5,cons(sk5,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_102])]) ).
cnf(c_0_116,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_112 ).
cnf(c_0_117,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_113,c_0_74]) ).
cnf(c_0_118,negated_conjecture,
( ~ ssList(app(app(X1,cons(sk5,X2)),sk1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(sk5,X2)),sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_63]),c_0_64]),c_0_57])]) ).
cnf(c_0_119,negated_conjecture,
app(cons(sk5,sk1),sk1) = cons(sk5,cons(sk5,sk1)),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_107]),c_0_69])]),c_0_115]) ).
cnf(c_0_120,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_61,c_0_115]),c_0_69]),c_0_102])]) ).
cnf(c_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_122,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_116]) ).
cnf(c_0_123,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_124,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk5,cons(sk5,sk1))) ),
inference(spm,[status(thm)],[c_0_117,c_0_69]) ).
cnf(c_0_125,negated_conjecture,
~ duplicatefreeP(cons(sk5,cons(sk5,sk1))),
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(spm,[status(thm)],[c_0_118,c_0_111]),c_0_119]),c_0_120]),c_0_69]),c_0_57]),c_0_119])]) ).
cnf(c_0_126,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_121 ).
cnf(c_0_127,plain,
( segmentP(app(X1,app(X2,X3)),X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_90]),c_0_92]) ).
cnf(c_0_128,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_123 ).
cnf(c_0_129,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_130,negated_conjecture,
totalorderedP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_63]),c_0_64])]) ).
cnf(c_0_131,negated_conjecture,
( segmentP(app(X1,cons(sk5,X2)),sk1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_68]),c_0_69])]) ).
cnf(c_0_132,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_129])]) ).
cnf(c_0_133,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_134,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_135,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_130])]) ).
cnf(c_0_136,negated_conjecture,
( segmentP(X1,sk1)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]),c_0_134])]) ).
cnf(c_0_137,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_138,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_139,negated_conjecture,
~ memberP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_50])]) ).
cnf(c_0_140,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
c_0_137 ).
cnf(c_0_141,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_138 ).
cnf(c_0_142,negated_conjecture,
~ neq(sk4,nil),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_143,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_141,c_0_129]),c_0_129])]) ).
cnf(c_0_144,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC341-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:37:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 248.99/32.06 # Version: 3.1.0
% 248.99/32.06 # Preprocessing class: FSLSSMSMSSSNFFN.
% 248.99/32.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 248.99/32.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 248.99/32.06 # Starting new_bool_3 with 300s (1) cores
% 248.99/32.06 # Starting new_bool_1 with 300s (1) cores
% 248.99/32.06 # Starting sh5l with 300s (1) cores
% 248.99/32.06 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14178 completed with status 0
% 248.99/32.06 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 248.99/32.06 # Preprocessing class: FSLSSMSMSSSNFFN.
% 248.99/32.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 248.99/32.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 248.99/32.06 # No SInE strategy applied
% 248.99/32.06 # Search class: FGHSM-FSLM21-MFFFFFNN
% 248.99/32.06 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 248.99/32.06 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 248.99/32.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 248.99/32.06 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 248.99/32.06 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 248.99/32.06 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 248.99/32.06 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14185 completed with status 0
% 248.99/32.06 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 248.99/32.06 # Preprocessing class: FSLSSMSMSSSNFFN.
% 248.99/32.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 248.99/32.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 248.99/32.06 # No SInE strategy applied
% 248.99/32.06 # Search class: FGHSM-FSLM21-MFFFFFNN
% 248.99/32.06 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 248.99/32.06 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 248.99/32.06 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 248.99/32.06 # Preprocessing time : 0.003 s
% 248.99/32.06 # Presaturation interreduction done
% 248.99/32.06
% 248.99/32.06 # Proof found!
% 248.99/32.06 # SZS status Unsatisfiable
% 248.99/32.06 # SZS output start CNFRefutation
% See solution above
% 248.99/32.06 # Parsed axioms : 196
% 248.99/32.06 # Removed by relevancy pruning/SinE : 0
% 248.99/32.06 # Initial clauses : 196
% 248.99/32.06 # Removed in clause preprocessing : 0
% 248.99/32.06 # Initial clauses in saturation : 196
% 248.99/32.06 # Processed clauses : 44452
% 248.99/32.06 # ...of these trivial : 205
% 248.99/32.06 # ...subsumed : 38004
% 248.99/32.06 # ...remaining for further processing : 6243
% 248.99/32.06 # Other redundant clauses eliminated : 11284
% 248.99/32.06 # Clauses deleted for lack of memory : 0
% 248.99/32.06 # Backward-subsumed : 543
% 248.99/32.06 # Backward-rewritten : 512
% 248.99/32.06 # Generated clauses : 1007497
% 248.99/32.06 # ...of the previous two non-redundant : 963792
% 248.99/32.06 # ...aggressively subsumed : 0
% 248.99/32.06 # Contextual simplify-reflections : 1590
% 248.99/32.06 # Paramodulations : 996144
% 248.99/32.06 # Factorizations : 2
% 248.99/32.06 # NegExts : 0
% 248.99/32.06 # Equation resolutions : 11351
% 248.99/32.06 # Disequality decompositions : 0
% 248.99/32.06 # Total rewrite steps : 850709
% 248.99/32.06 # ...of those cached : 837875
% 248.99/32.06 # Propositional unsat checks : 1
% 248.99/32.06 # Propositional check models : 0
% 248.99/32.06 # Propositional check unsatisfiable : 0
% 248.99/32.06 # Propositional clauses : 0
% 248.99/32.06 # Propositional clauses after purity: 0
% 248.99/32.06 # Propositional unsat core size : 0
% 248.99/32.06 # Propositional preprocessing time : 0.000
% 248.99/32.06 # Propositional encoding time : 2.141
% 248.99/32.06 # Propositional solver time : 0.831
% 248.99/32.06 # Success case prop preproc time : 0.000
% 248.99/32.06 # Success case prop encoding time : 0.000
% 248.99/32.06 # Success case prop solver time : 0.000
% 248.99/32.06 # Current number of processed clauses : 4976
% 248.99/32.06 # Positive orientable unit clauses : 297
% 248.99/32.06 # Positive unorientable unit clauses: 0
% 248.99/32.06 # Negative unit clauses : 309
% 248.99/32.06 # Non-unit-clauses : 4370
% 248.99/32.06 # Current number of unprocessed clauses: 903281
% 248.99/32.06 # ...number of literals in the above : 7640461
% 248.99/32.06 # Current number of archived formulas : 0
% 248.99/32.06 # Current number of archived clauses : 1244
% 248.99/32.06 # Clause-clause subsumption calls (NU) : 4040654
% 248.99/32.06 # Rec. Clause-clause subsumption calls : 353738
% 248.99/32.06 # Non-unit clause-clause subsumptions : 14612
% 248.99/32.06 # Unit Clause-clause subsumption calls : 31492
% 248.99/32.06 # Rewrite failures with RHS unbound : 0
% 248.99/32.06 # BW rewrite match attempts : 580
% 248.99/32.06 # BW rewrite match successes : 130
% 248.99/32.06 # Condensation attempts : 0
% 248.99/32.06 # Condensation successes : 0
% 248.99/32.06 # Termbank termtop insertions : 44446378
% 248.99/32.06 # Search garbage collected termcells : 540
% 248.99/32.06
% 248.99/32.06 # -------------------------------------------------
% 248.99/32.06 # User time : 29.925 s
% 248.99/32.06 # System time : 0.869 s
% 248.99/32.06 # Total time : 30.795 s
% 248.99/32.06 # Maximum resident set size: 2132 pages
% 248.99/32.06
% 248.99/32.06 # -------------------------------------------------
% 248.99/32.06 # User time : 150.417 s
% 248.99/32.06 # System time : 4.663 s
% 248.99/32.06 # Total time : 155.080 s
% 248.99/32.06 # Maximum resident set size: 1896 pages
% 248.99/32.06 % E---3.1 exiting
% 248.99/32.06 % E exiting
%------------------------------------------------------------------------------