TSTP Solution File: SWC119-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC119-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:44 EDT 2024
% Result : Unsatisfiable 12.35s 2.02s
% Output : CNFRefutation 12.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 39
% Syntax : Number of clauses : 165 ( 38 unt; 23 nHn; 159 RR)
% Number of literals : 451 ( 147 equ; 277 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 208 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
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(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause129,axiom,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause129) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_11,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(c_0_39,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_40,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_41,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_42,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_44,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_45,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
c_0_40 ).
cnf(c_0_46,negated_conjecture,
sk1 = sk3,
co1_6 ).
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,
ssList(sk2),
co1_2 ).
cnf(c_0_49,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_41 ).
cnf(c_0_50,negated_conjecture,
( sk1 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_52,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_44 ).
cnf(c_0_53,negated_conjecture,
( cons(sk5,nil) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_55,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_56,axiom,
ssList(nil),
clause8 ).
cnf(c_0_57,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_46]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_51 ).
cnf(c_0_59,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_60,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_61,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_62,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_63,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_64,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_53,c_0_54]),c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_65,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_58,c_0_54]),c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_66,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_67,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_59 ).
cnf(c_0_68,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_60 ).
cnf(c_0_69,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_61 ).
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,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_72,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_62 ).
cnf(c_0_73,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_56])]) ).
cnf(c_0_74,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_75,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_66 ).
cnf(c_0_76,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_67]),c_0_68]) ).
cnf(c_0_77,negated_conjecture,
( app(sk1,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_64]),c_0_65])]) ).
cnf(c_0_78,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_70 ).
cnf(c_0_79,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_71 ).
cnf(c_0_80,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_65]),c_0_74])]) ).
cnf(c_0_81,negated_conjecture,
hd(sk1) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_64]),c_0_65]),c_0_56])]) ).
cnf(c_0_82,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_83,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_84,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_85,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_86,negated_conjecture,
( rearsegP(cons(sk5,X1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_74])]) ).
cnf(c_0_87,plain,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause129]) ).
cnf(c_0_88,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_78]),c_0_68]) ).
cnf(c_0_89,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_90,negated_conjecture,
( hd(skaf42(sk1,sk5)) = sk5
| skaf42(sk1,sk5) = nil
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82])]) ).
cnf(c_0_91,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_83 ).
cnf(c_0_92,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_93,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_84 ).
cnf(c_0_94,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_85 ).
cnf(c_0_95,negated_conjecture,
rearsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_64]),c_0_56])]) ).
cnf(c_0_96,plain,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_97,negated_conjecture,
( frontsegP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_77]),c_0_74])]) ).
cnf(c_0_98,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_77]),c_0_74])]) ).
cnf(c_0_99,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_89 ).
cnf(c_0_100,negated_conjecture,
( hd(skaf42(sk1,sk5)) = sk5
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_65]),c_0_92])]) ).
cnf(c_0_101,negated_conjecture,
( frontsegP(sk1,skaf42(sk1,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_80]),c_0_82])]) ).
cnf(c_0_102,negated_conjecture,
( X1 = sk1
| app(X1,X2) != cons(sk5,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_77]),c_0_74])]) ).
cnf(c_0_103,negated_conjecture,
app(skaf46(sk1,nil),nil) = sk1,
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_74])]) ).
cnf(c_0_104,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_105,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_96,c_0_97]),c_0_74])]),c_0_98]) ).
cnf(c_0_106,negated_conjecture,
( cons(sk5,tl(skaf42(sk1,sk5))) = skaf42(sk1,sk5)
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_82])]) ).
cnf(c_0_107,negated_conjecture,
frontsegP(sk1,skaf42(sk1,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_91]),c_0_65]),c_0_92])]) ).
cnf(c_0_108,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_109,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_110,negated_conjecture,
skaf46(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_64]),c_0_56]),c_0_104])]) ).
cnf(c_0_111,negated_conjecture,
( skaf42(sk1,sk5) = nil
| skaf42(sk1,sk5) = sk1
| ~ ssList(tl(skaf42(sk1,sk5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107])]) ).
cnf(c_0_112,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_108 ).
cnf(c_0_113,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_109 ).
cnf(c_0_114,negated_conjecture,
app(sk1,nil) = sk1,
inference(rw,[status(thm)],[c_0_103,c_0_110]) ).
cnf(c_0_115,negated_conjecture,
( skaf42(sk1,sk5) = sk1
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_82])]) ).
cnf(c_0_116,negated_conjecture,
( nil = X1
| app(sk1,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_56]),c_0_74])]) ).
cnf(c_0_117,negated_conjecture,
( app(sk1,cons(sk5,skaf43(sk5,sk1))) = sk1
| skaf42(sk1,sk5) = nil ),
inference(spm,[status(thm)],[c_0_80,c_0_115]) ).
cnf(c_0_118,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_119,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) = nil
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_120,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_118 ).
cnf(c_0_121,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_91]),c_0_65]),c_0_92])]) ).
cnf(c_0_122,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_123,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_124,negated_conjecture,
skaf42(sk1,sk5) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_65]),c_0_92])]) ).
cnf(c_0_125,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_126,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_122 ).
cnf(c_0_127,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_128,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_123 ).
cnf(c_0_129,negated_conjecture,
app(nil,cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(rw,[status(thm)],[c_0_80,c_0_124]) ).
cnf(c_0_130,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_131,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_125 ).
cnf(c_0_132,negated_conjecture,
tl(sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_64]),c_0_65]),c_0_56])]) ).
cnf(c_0_133,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_64]),c_0_65]),c_0_56])]) ).
cnf(c_0_134,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_127 ).
cnf(c_0_135,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_136,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = sk1
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_137,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_130 ).
cnf(c_0_138,negated_conjecture,
( tl(cons(sk5,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_77]),c_0_132]),c_0_74])]),c_0_133]) ).
cnf(c_0_139,negated_conjecture,
( cons(sk5,X1) != nil
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_77]),c_0_74])]),c_0_133]) ).
cnf(c_0_140,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_135 ).
cnf(c_0_141,negated_conjecture,
cons(sk5,skaf43(sk5,sk1)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_91]),c_0_65]),c_0_92])]) ).
cnf(c_0_142,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_137,c_0_64]),c_0_65]),c_0_56])]) ).
cnf(c_0_143,negated_conjecture,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_138]),c_0_98]),c_0_139]) ).
cnf(c_0_144,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_140]) ).
cnf(c_0_145,negated_conjecture,
app(nil,sk1) = sk1,
inference(rw,[status(thm)],[c_0_129,c_0_141]) ).
cnf(c_0_146,negated_conjecture,
( ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_142]),c_0_65])]),c_0_143]) ).
cnf(c_0_147,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_148,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_149,negated_conjecture,
( segmentP(app(sk1,X1),sk1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_74]),c_0_56])]),c_0_146]) ).
cnf(c_0_150,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
c_0_147 ).
cnf(c_0_151,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_152,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_148 ).
cnf(c_0_153,negated_conjecture,
( segmentP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_149,c_0_77]) ).
cnf(c_0_154,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_54]),c_0_55]),c_0_56])]),c_0_57]) ).
cnf(c_0_155,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
c_0_151 ).
cnf(c_0_156,negated_conjecture,
( segmentP(app(app(X1,cons(sk5,X2)),X3),sk1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_74])]),c_0_98]) ).
cnf(c_0_157,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_72,c_0_154]),c_0_65]),c_0_55])]) ).
cnf(c_0_158,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_159,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_155,c_0_43]) ).
cnf(c_0_160,negated_conjecture,
( segmentP(app(sk4,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_82]),c_0_92])]) ).
cnf(c_0_161,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_158 ).
cnf(c_0_162,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_54]),c_0_74]),c_0_56])]) ).
cnf(c_0_163,negated_conjecture,
segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_56]),c_0_55])]) ).
cnf(c_0_164,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_162,c_0_163])]),c_0_133]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC119-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 03:41:52 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 12.35/2.02 # Version: 3.1.0
% 12.35/2.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 12.35/2.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.35/2.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 12.35/2.02 # Starting new_bool_3 with 300s (1) cores
% 12.35/2.02 # Starting new_bool_1 with 300s (1) cores
% 12.35/2.02 # Starting sh5l with 300s (1) cores
% 12.35/2.02 # sh5l with pid 4222 completed with status 0
% 12.35/2.02 # Result found by sh5l
% 12.35/2.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 12.35/2.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.35/2.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 12.35/2.02 # Starting new_bool_3 with 300s (1) cores
% 12.35/2.02 # Starting new_bool_1 with 300s (1) cores
% 12.35/2.02 # Starting sh5l with 300s (1) cores
% 12.35/2.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 12.35/2.02 # Search class: FGHSM-FSLM21-MFFFFFNN
% 12.35/2.02 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 12.35/2.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 12.35/2.02 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 4228 completed with status 0
% 12.35/2.02 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 12.35/2.02 # Preprocessing class: FSLSSMSMSSSNFFN.
% 12.35/2.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.35/2.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 12.35/2.02 # Starting new_bool_3 with 300s (1) cores
% 12.35/2.02 # Starting new_bool_1 with 300s (1) cores
% 12.35/2.02 # Starting sh5l with 300s (1) cores
% 12.35/2.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 12.35/2.02 # Search class: FGHSM-FSLM21-MFFFFFNN
% 12.35/2.02 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 12.35/2.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 12.35/2.02 # Preprocessing time : 0.002 s
% 12.35/2.02 # Presaturation interreduction done
% 12.35/2.02
% 12.35/2.02 # Proof found!
% 12.35/2.02 # SZS status Unsatisfiable
% 12.35/2.02 # SZS output start CNFRefutation
% See solution above
% 12.35/2.03 # Parsed axioms : 197
% 12.35/2.03 # Removed by relevancy pruning/SinE : 33
% 12.35/2.03 # Initial clauses : 164
% 12.35/2.03 # Removed in clause preprocessing : 0
% 12.35/2.03 # Initial clauses in saturation : 164
% 12.35/2.03 # Processed clauses : 11569
% 12.35/2.03 # ...of these trivial : 207
% 12.35/2.03 # ...subsumed : 8561
% 12.35/2.03 # ...remaining for further processing : 2801
% 12.35/2.03 # Other redundant clauses eliminated : 284
% 12.35/2.03 # Clauses deleted for lack of memory : 0
% 12.35/2.03 # Backward-subsumed : 140
% 12.35/2.03 # Backward-rewritten : 274
% 12.35/2.03 # Generated clauses : 57591
% 12.35/2.03 # ...of the previous two non-redundant : 50092
% 12.35/2.03 # ...aggressively subsumed : 0
% 12.35/2.03 # Contextual simplify-reflections : 537
% 12.35/2.03 # Paramodulations : 57272
% 12.35/2.03 # Factorizations : 2
% 12.35/2.03 # NegExts : 0
% 12.35/2.03 # Equation resolutions : 312
% 12.35/2.03 # Disequality decompositions : 0
% 12.35/2.03 # Total rewrite steps : 85718
% 12.35/2.03 # ...of those cached : 84896
% 12.35/2.03 # Propositional unsat checks : 0
% 12.35/2.03 # Propositional check models : 0
% 12.35/2.03 # Propositional check unsatisfiable : 0
% 12.35/2.03 # Propositional clauses : 0
% 12.35/2.03 # Propositional clauses after purity: 0
% 12.35/2.03 # Propositional unsat core size : 0
% 12.35/2.03 # Propositional preprocessing time : 0.000
% 12.35/2.03 # Propositional encoding time : 0.000
% 12.35/2.03 # Propositional solver time : 0.000
% 12.35/2.03 # Success case prop preproc time : 0.000
% 12.35/2.03 # Success case prop encoding time : 0.000
% 12.35/2.03 # Success case prop solver time : 0.000
% 12.35/2.03 # Current number of processed clauses : 2206
% 12.35/2.03 # Positive orientable unit clauses : 378
% 12.35/2.03 # Positive unorientable unit clauses: 0
% 12.35/2.03 # Negative unit clauses : 233
% 12.35/2.03 # Non-unit-clauses : 1595
% 12.35/2.03 # Current number of unprocessed clauses: 38181
% 12.35/2.03 # ...number of literals in the above : 208303
% 12.35/2.03 # Current number of archived formulas : 0
% 12.35/2.03 # Current number of archived clauses : 575
% 12.35/2.03 # Clause-clause subsumption calls (NU) : 536503
% 12.35/2.03 # Rec. Clause-clause subsumption calls : 153539
% 12.35/2.03 # Non-unit clause-clause subsumptions : 4576
% 12.35/2.03 # Unit Clause-clause subsumption calls : 23509
% 12.35/2.03 # Rewrite failures with RHS unbound : 0
% 12.35/2.03 # BW rewrite match attempts : 846
% 12.35/2.03 # BW rewrite match successes : 120
% 12.35/2.03 # Condensation attempts : 0
% 12.35/2.03 # Condensation successes : 0
% 12.35/2.03 # Termbank termtop insertions : 1500052
% 12.35/2.03 # Search garbage collected termcells : 626
% 12.35/2.03
% 12.35/2.03 # -------------------------------------------------
% 12.35/2.03 # User time : 1.486 s
% 12.35/2.03 # System time : 0.045 s
% 12.35/2.03 # Total time : 1.531 s
% 12.35/2.03 # Maximum resident set size: 2312 pages
% 12.35/2.03
% 12.35/2.03 # -------------------------------------------------
% 12.35/2.03 # User time : 1.489 s
% 12.35/2.03 # System time : 0.048 s
% 12.35/2.03 # Total time : 1.537 s
% 12.35/2.03 # Maximum resident set size: 1880 pages
% 12.35/2.03 % E---3.1 exiting
%------------------------------------------------------------------------------