TSTP Solution File: SWC114-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC114-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:27:42 EDT 2024
% Result : Unsatisfiable 1.84s 0.72s
% Output : CNFRefutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 36
% Syntax : Number of clauses : 143 ( 44 unt; 19 nHn; 129 RR)
% Number of literals : 383 ( 85 equ; 240 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 : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 194 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause143) ).
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(co1_13,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause154,axiom,
( frontsegP(X1,X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause154) ).
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(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
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(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(co1_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
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(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(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(c_0_36,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_37,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_38,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_40,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_41,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_37 ).
cnf(c_0_42,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_10 ).
cnf(c_0_43,axiom,
ssList(nil),
clause8 ).
cnf(c_0_44,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_8 ).
cnf(c_0_45,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_47,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_48,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_49,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_13 ).
cnf(c_0_50,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),c_0_44]),c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_9 ).
cnf(c_0_52,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_46 ).
cnf(c_0_53,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_54,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_48 ).
cnf(c_0_55,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_58,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_52]),c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_60,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_57,c_0_39]) ).
cnf(c_0_61,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_62,negated_conjecture,
( rearsegP(cons(sk5,X1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_63,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_64,negated_conjecture,
rearsegP(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_55]),c_0_43])]) ).
cnf(c_0_65,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_66,negated_conjecture,
( rearsegP(app(X1,sk3),nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_43]),c_0_60])]) ).
cnf(c_0_67,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_65 ).
cnf(c_0_68,negated_conjecture,
rearsegP(cons(sk5,sk3),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_59]),c_0_60])]) ).
cnf(c_0_69,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_70,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_71,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_72,negated_conjecture,
( app(skaf46(cons(sk5,sk3),nil),nil) = cons(sk5,sk3)
| ~ ssList(cons(sk5,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_43])]) ).
cnf(c_0_73,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_69 ).
cnf(c_0_74,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_70 ).
cnf(c_0_75,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_76,negated_conjecture,
app(skaf46(cons(sk5,sk3),nil),nil) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_56]),c_0_60])]) ).
cnf(c_0_77,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_78,plain,
( frontsegP(X1,X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause154]) ).
cnf(c_0_79,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_74]),c_0_53]) ).
cnf(c_0_80,negated_conjecture,
skaf46(cons(sk5,sk3),nil) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77])]) ).
cnf(c_0_81,plain,
( frontsegP(X1,X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_78 ).
cnf(c_0_82,negated_conjecture,
( frontsegP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_59]),c_0_60])]) ).
cnf(c_0_83,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_59]),c_0_60])]) ).
cnf(c_0_84,negated_conjecture,
app(cons(sk5,sk3),nil) = cons(sk5,sk3),
inference(rw,[status(thm)],[c_0_76,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
ssList(cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_76]),c_0_77]),c_0_43])]) ).
cnf(c_0_86,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_87,negated_conjecture,
( frontsegP(X1,sk3)
| ~ frontsegP(X1,cons(sk5,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_60])]),c_0_83]) ).
cnf(c_0_88,negated_conjecture,
frontsegP(cons(sk5,sk3),cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_84]),c_0_43]),c_0_85])]) ).
cnf(c_0_89,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_86 ).
cnf(c_0_90,negated_conjecture,
frontsegP(cons(sk5,sk3),sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_85]),c_0_60])]) ).
cnf(c_0_91,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_92,negated_conjecture,
app(sk3,skaf45(cons(sk5,sk3),sk3)) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_60]),c_0_85])]) ).
cnf(c_0_93,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_94,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_91 ).
cnf(c_0_95,negated_conjecture,
cons(sk5,skaf45(cons(sk5,sk3),sk3)) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_92]),c_0_93])]) ).
cnf(c_0_96,negated_conjecture,
skaf45(cons(sk5,sk3),sk3) = tl(cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_56]),c_0_93])]) ).
cnf(c_0_97,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_98,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_99,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_14 ).
cnf(c_0_100,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_101,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_102,negated_conjecture,
app(sk3,tl(cons(sk5,sk3))) = cons(sk5,sk3),
inference(rw,[status(thm)],[c_0_92,c_0_96]) ).
cnf(c_0_103,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_97 ).
cnf(c_0_104,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_98 ).
cnf(c_0_105,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_99,c_0_50]) ).
cnf(c_0_106,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_100,c_0_40]) ).
cnf(c_0_107,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_108,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_101 ).
cnf(c_0_109,negated_conjecture,
app(sk3,sk3) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_94]),c_0_56]),c_0_60])]) ).
cnf(c_0_110,negated_conjecture,
tl(sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_55]),c_0_56]),c_0_43])]) ).
cnf(c_0_111,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_103]) ).
cnf(c_0_112,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_56]),c_0_106])]) ).
cnf(c_0_113,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_114,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_115,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_107 ).
cnf(c_0_116,negated_conjecture,
tl(cons(sk5,sk3)) = app(nil,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),c_0_60])]),c_0_50]) ).
cnf(c_0_117,negated_conjecture,
( ~ ssList(app(sk4,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk4,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_56]),c_0_113]),c_0_114])]) ).
cnf(c_0_118,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_119,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_115]) ).
cnf(c_0_120,negated_conjecture,
app(nil,sk3) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_116]),c_0_56]),c_0_60])]) ).
cnf(c_0_121,negated_conjecture,
( ~ ssList(app(sk4,sk3))
| ~ duplicatefreeP(app(sk4,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_55]),c_0_43])]) ).
cnf(c_0_122,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_118 ).
cnf(c_0_123,negated_conjecture,
( segmentP(app(sk3,X1),sk3)
| ~ ssList(app(sk3,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_60]),c_0_43])]) ).
cnf(c_0_124,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,sk3)) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_126,negated_conjecture,
( segmentP(app(sk3,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_53]),c_0_60])]) ).
cnf(c_0_127,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_53]),c_0_106]),c_0_60])]) ).
cnf(c_0_128,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_129,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_125 ).
cnf(c_0_130,negated_conjecture,
( segmentP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_59]) ).
cnf(c_0_131,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_127])]) ).
cnf(c_0_132,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_133,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
c_0_128 ).
cnf(c_0_134,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_135,negated_conjecture,
( segmentP(app(app(X1,cons(sk5,X2)),X3),sk3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_60])]),c_0_131]) ).
cnf(c_0_136,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
c_0_132 ).
cnf(c_0_137,negated_conjecture,
( ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_133,c_0_40]),c_0_39]),c_0_39]) ).
cnf(c_0_138,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_134 ).
cnf(c_0_139,negated_conjecture,
( segmentP(app(sk4,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_112]),c_0_114]),c_0_113])]) ).
cnf(c_0_140,plain,
( app(X1,skaf45(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_136]) ).
cnf(c_0_141,negated_conjecture,
~ segmentP(sk4,sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_60]),c_0_43])]),c_0_50]) ).
cnf(c_0_142,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_93]),c_0_106])]),c_0_141]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC114-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n018.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Sun May 19 02:39:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 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/benchmark/theBenchmark.p
% 1.84/0.72 # Version: 3.1.0
% 1.84/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.84/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.84/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.84/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.84/0.72 # Starting sh5l with 300s (1) cores
% 1.84/0.72 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32058 completed with status 0
% 1.84/0.72 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.84/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.84/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.84/0.72 # No SInE strategy applied
% 1.84/0.72 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.84/0.72 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.84/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.84/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.84/0.72 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.84/0.72 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.84/0.72 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.84/0.72 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 32062 completed with status 0
% 1.84/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.84/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.84/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.84/0.72 # No SInE strategy applied
% 1.84/0.72 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.84/0.72 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.84/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.84/0.72 # Preprocessing time : 0.003 s
% 1.84/0.72 # Presaturation interreduction done
% 1.84/0.72
% 1.84/0.72 # Proof found!
% 1.84/0.72 # SZS status Unsatisfiable
% 1.84/0.72 # SZS output start CNFRefutation
% See solution above
% 1.84/0.72 # Parsed axioms : 201
% 1.84/0.72 # Removed by relevancy pruning/SinE : 0
% 1.84/0.72 # Initial clauses : 201
% 1.84/0.72 # Removed in clause preprocessing : 0
% 1.84/0.72 # Initial clauses in saturation : 201
% 1.84/0.72 # Processed clauses : 3076
% 1.84/0.72 # ...of these trivial : 81
% 1.84/0.72 # ...subsumed : 1541
% 1.84/0.72 # ...remaining for further processing : 1454
% 1.84/0.72 # Other redundant clauses eliminated : 129
% 1.84/0.72 # Clauses deleted for lack of memory : 0
% 1.84/0.72 # Backward-subsumed : 92
% 1.84/0.72 # Backward-rewritten : 294
% 1.84/0.72 # Generated clauses : 10990
% 1.84/0.72 # ...of the previous two non-redundant : 9271
% 1.84/0.72 # ...aggressively subsumed : 0
% 1.84/0.72 # Contextual simplify-reflections : 110
% 1.84/0.72 # Paramodulations : 10832
% 1.84/0.72 # Factorizations : 0
% 1.84/0.72 # NegExts : 0
% 1.84/0.72 # Equation resolutions : 147
% 1.84/0.72 # Disequality decompositions : 0
% 1.84/0.72 # Total rewrite steps : 13762
% 1.84/0.72 # ...of those cached : 13242
% 1.84/0.72 # Propositional unsat checks : 0
% 1.84/0.72 # Propositional check models : 0
% 1.84/0.72 # Propositional check unsatisfiable : 0
% 1.84/0.72 # Propositional clauses : 0
% 1.84/0.72 # Propositional clauses after purity: 0
% 1.84/0.72 # Propositional unsat core size : 0
% 1.84/0.72 # Propositional preprocessing time : 0.000
% 1.84/0.72 # Propositional encoding time : 0.000
% 1.84/0.72 # Propositional solver time : 0.000
% 1.84/0.72 # Success case prop preproc time : 0.000
% 1.84/0.72 # Success case prop encoding time : 0.000
% 1.84/0.72 # Success case prop solver time : 0.000
% 1.84/0.72 # Current number of processed clauses : 840
% 1.84/0.72 # Positive orientable unit clauses : 233
% 1.84/0.72 # Positive unorientable unit clauses: 0
% 1.84/0.72 # Negative unit clauses : 91
% 1.84/0.72 # Non-unit-clauses : 516
% 1.84/0.72 # Current number of unprocessed clauses: 5735
% 1.84/0.72 # ...number of literals in the above : 23957
% 1.84/0.72 # Current number of archived formulas : 0
% 1.84/0.72 # Current number of archived clauses : 591
% 1.84/0.72 # Clause-clause subsumption calls (NU) : 66947
% 1.84/0.72 # Rec. Clause-clause subsumption calls : 24163
% 1.84/0.72 # Non-unit clause-clause subsumptions : 927
% 1.84/0.72 # Unit Clause-clause subsumption calls : 5308
% 1.84/0.72 # Rewrite failures with RHS unbound : 0
% 1.84/0.72 # BW rewrite match attempts : 168
% 1.84/0.72 # BW rewrite match successes : 102
% 1.84/0.72 # Condensation attempts : 0
% 1.84/0.72 # Condensation successes : 0
% 1.84/0.72 # Termbank termtop insertions : 209129
% 1.84/0.72 # Search garbage collected termcells : 547
% 1.84/0.72
% 1.84/0.72 # -------------------------------------------------
% 1.84/0.72 # User time : 0.227 s
% 1.84/0.72 # System time : 0.008 s
% 1.84/0.72 # Total time : 0.235 s
% 1.84/0.72 # Maximum resident set size: 2144 pages
% 1.84/0.72
% 1.84/0.72 # -------------------------------------------------
% 1.84/0.72 # User time : 1.182 s
% 1.84/0.72 # System time : 0.058 s
% 1.84/0.72 # Total time : 1.240 s
% 1.84/0.72 # Maximum resident set size: 1880 pages
% 1.84/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------