TSTP Solution File: SWC087-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC087-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:23:10 EDT 2024
% Result : Unsatisfiable 27.88s 3.98s
% Output : CNFRefutation 27.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 26
% Syntax : Number of clauses : 128 ( 24 unt; 21 nHn; 128 RR)
% Number of literals : 433 ( 107 equ; 297 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 198 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(clause152,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause152) ).
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_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_12,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(c_0_26,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_27,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_28,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_29,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_30,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_31,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_26 ).
cnf(c_0_32,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_27 ).
cnf(c_0_33,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_28 ).
cnf(c_0_34,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_35,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_36,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_29 ).
cnf(c_0_37,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_30 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,plain,
( app(X1,X2) = X3
| app(X1,app(X2,X4)) != app(X3,X4)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_40,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_41,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_42,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_43,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_35 ).
cnf(c_0_44,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_45,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_46,plain,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause152]) ).
cnf(c_0_47,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_36]) ).
cnf(c_0_48,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_49,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]),c_0_38])]) ).
cnf(c_0_50,plain,
( app(X1,nil) = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_38])]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_52,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_53,plain,
( X1 = app(X2,X3)
| neq(app(X2,X3),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_54,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_55,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_44 ).
cnf(c_0_56,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_45 ).
cnf(c_0_57,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_58,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_59,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_60,plain,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_46 ).
cnf(c_0_61,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_38])]),c_0_33]) ).
cnf(c_0_62,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_48 ).
cnf(c_0_63,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_33]) ).
cnf(c_0_64,plain,
( app(nil,app(nil,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_49]),c_0_38])]) ).
cnf(c_0_65,negated_conjecture,
( app(X1,nil) = sk4
| app(X1,X2) != app(sk4,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_67,negated_conjecture,
neq(sk2,nil),
c_0_52 ).
cnf(c_0_68,plain,
( app(X1,X2) = nil
| neq(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_38]) ).
cnf(c_0_69,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_54 ).
cnf(c_0_70,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_33]) ).
cnf(c_0_71,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_57 ).
cnf(c_0_72,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_58 ).
cnf(c_0_73,negated_conjecture,
( app(X1,nil) = sk1
| app(X1,X2) != app(sk1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_59]) ).
cnf(c_0_74,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_33]) ).
cnf(c_0_75,plain,
( segmentP(app(nil,X1),X2)
| ~ segmentP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_49]),c_0_38])]) ).
cnf(c_0_76,plain,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_38])]) ).
cnf(c_0_77,negated_conjecture,
( app(sk4,nil) = sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_65]),c_0_51])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
c_0_66 ).
cnf(c_0_79,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_67,c_0_42]) ).
cnf(c_0_80,plain,
( neq(app(cons(X1,X2),X3),nil)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_81,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_49]),c_0_38])]) ).
cnf(c_0_82,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_56]),c_0_33]) ).
cnf(c_0_83,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_71]),c_0_38])]),c_0_33]) ).
cnf(c_0_84,negated_conjecture,
( sk3 = X1
| tl(sk4) != X2
| hd(sk4) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_72]) ).
cnf(c_0_85,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_86,negated_conjecture,
( app(sk1,nil) = sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_73]),c_0_59])]) ).
cnf(c_0_87,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_88,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_89,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_90,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_91,plain,
( segmentP(app(nil,X1),X2)
| ~ segmentP(nil,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_33]),c_0_76]) ).
cnf(c_0_92,negated_conjecture,
app(sk4,nil) = sk4,
inference(spm,[status(thm)],[c_0_77,c_0_51]) ).
cnf(c_0_93,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_32]),c_0_38])]),c_0_33]) ).
cnf(c_0_94,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_49]),c_0_38])]) ).
cnf(c_0_95,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_42]),c_0_79])]) ).
cnf(c_0_96,plain,
( neq(cons(X1,nil),nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_38])]) ).
cnf(c_0_97,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_81]),c_0_38])]) ).
cnf(c_0_98,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X3,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_83]),c_0_33]) ).
cnf(c_0_99,negated_conjecture,
( app(tl(sk4),cons(hd(sk4),nil)) = sk1
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_79])])])])])]),c_0_33]) ).
cnf(c_0_100,negated_conjecture,
app(sk1,nil) = sk1,
inference(spm,[status(thm)],[c_0_86,c_0_51]) ).
cnf(c_0_101,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_102,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_88 ).
cnf(c_0_103,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_89 ).
cnf(c_0_104,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_90 ).
cnf(c_0_105,negated_conjecture,
( segmentP(app(nil,X1),sk4)
| ~ segmentP(nil,sk4)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_51]),c_0_38])]) ).
cnf(c_0_106,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_93]),c_0_38])]),c_0_94]) ).
cnf(c_0_107,negated_conjecture,
( ~ segmentP(sk1,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_79]),c_0_51])]) ).
cnf(c_0_108,negated_conjecture,
segmentP(sk4,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_92]),c_0_38]),c_0_51])]) ).
cnf(c_0_109,negated_conjecture,
( ~ segmentP(sk1,cons(X1,nil))
| ~ segmentP(sk4,cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]) ).
cnf(c_0_110,negated_conjecture,
( segmentP(X1,cons(hd(sk4),nil))
| ~ neq(nil,sk4)
| ~ segmentP(X1,sk1)
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_97]) ).
cnf(c_0_111,negated_conjecture,
segmentP(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_100]),c_0_38]),c_0_59])]) ).
cnf(c_0_112,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_101]),c_0_97]) ).
cnf(c_0_113,negated_conjecture,
( cons(hd(sk4),tl(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_102,c_0_51]) ).
cnf(c_0_114,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_103,c_0_51]) ).
cnf(c_0_115,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_104,c_0_51]) ).
cnf(c_0_116,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_117,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_118,negated_conjecture,
( segmentP(app(X1,nil),sk4)
| ~ segmentP(nil,sk4)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_119,negated_conjecture,
~ segmentP(sk1,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108])]) ).
cnf(c_0_120,negated_conjecture,
( ~ neq(nil,sk4)
| ~ segmentP(sk4,cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]),c_0_59])]) ).
cnf(c_0_121,negated_conjecture,
( sk4 = nil
| segmentP(sk4,cons(hd(sk4),nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_115]) ).
cnf(c_0_122,negated_conjecture,
( sk4 = nil
| neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_116,c_0_51]) ).
cnf(c_0_123,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_117 ).
cnf(c_0_124,negated_conjecture,
~ segmentP(nil,sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_100]),c_0_59])]),c_0_119]) ).
cnf(c_0_125,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_114]),c_0_115]),c_0_122]) ).
cnf(c_0_126,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_123]),c_0_38])]) ).
cnf(c_0_127,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125]),c_0_126])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC087-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 03:26:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 27.88/3.98 # Version: 3.1.0
% 27.88/3.98 # Preprocessing class: FSLSSMSSSSSNFFN.
% 27.88/3.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.88/3.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 27.88/3.98 # Starting new_bool_3 with 300s (1) cores
% 27.88/3.98 # Starting new_bool_1 with 300s (1) cores
% 27.88/3.98 # Starting sh5l with 300s (1) cores
% 27.88/3.98 # new_bool_1 with pid 8632 completed with status 0
% 27.88/3.98 # Result found by new_bool_1
% 27.88/3.98 # Preprocessing class: FSLSSMSSSSSNFFN.
% 27.88/3.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.88/3.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 27.88/3.98 # Starting new_bool_3 with 300s (1) cores
% 27.88/3.98 # Starting new_bool_1 with 300s (1) cores
% 27.88/3.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 27.88/3.98 # Search class: FGHSF-FFMM21-MFFFFFNN
% 27.88/3.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 27.88/3.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 27.88/3.98 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8635 completed with status 0
% 27.88/3.98 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 27.88/3.98 # Preprocessing class: FSLSSMSSSSSNFFN.
% 27.88/3.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.88/3.98 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 27.88/3.98 # Starting new_bool_3 with 300s (1) cores
% 27.88/3.98 # Starting new_bool_1 with 300s (1) cores
% 27.88/3.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 27.88/3.98 # Search class: FGHSF-FFMM21-MFFFFFNN
% 27.88/3.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 27.88/3.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 27.88/3.98 # Preprocessing time : 0.002 s
% 27.88/3.98 # Presaturation interreduction done
% 27.88/3.98
% 27.88/3.98 # Proof found!
% 27.88/3.98 # SZS status Unsatisfiable
% 27.88/3.98 # SZS output start CNFRefutation
% See solution above
% 27.88/3.98 # Parsed axioms : 197
% 27.88/3.98 # Removed by relevancy pruning/SinE : 121
% 27.88/3.98 # Initial clauses : 76
% 27.88/3.98 # Removed in clause preprocessing : 0
% 27.88/3.98 # Initial clauses in saturation : 76
% 27.88/3.98 # Processed clauses : 13394
% 27.88/3.98 # ...of these trivial : 56
% 27.88/3.98 # ...subsumed : 9642
% 27.88/3.98 # ...remaining for further processing : 3696
% 27.88/3.98 # Other redundant clauses eliminated : 79
% 27.88/3.98 # Clauses deleted for lack of memory : 0
% 27.88/3.98 # Backward-subsumed : 175
% 27.88/3.98 # Backward-rewritten : 1947
% 27.88/3.98 # Generated clauses : 244086
% 27.88/3.98 # ...of the previous two non-redundant : 241490
% 27.88/3.98 # ...aggressively subsumed : 0
% 27.88/3.98 # Contextual simplify-reflections : 1291
% 27.88/3.98 # Paramodulations : 243942
% 27.88/3.98 # Factorizations : 0
% 27.88/3.98 # NegExts : 0
% 27.88/3.98 # Equation resolutions : 148
% 27.88/3.98 # Disequality decompositions : 0
% 27.88/3.98 # Total rewrite steps : 71439
% 27.88/3.98 # ...of those cached : 71420
% 27.88/3.98 # Propositional unsat checks : 0
% 27.88/3.98 # Propositional check models : 0
% 27.88/3.98 # Propositional check unsatisfiable : 0
% 27.88/3.98 # Propositional clauses : 0
% 27.88/3.98 # Propositional clauses after purity: 0
% 27.88/3.98 # Propositional unsat core size : 0
% 27.88/3.98 # Propositional preprocessing time : 0.000
% 27.88/3.98 # Propositional encoding time : 0.000
% 27.88/3.98 # Propositional solver time : 0.000
% 27.88/3.98 # Success case prop preproc time : 0.000
% 27.88/3.98 # Success case prop encoding time : 0.000
% 27.88/3.98 # Success case prop solver time : 0.000
% 27.88/3.98 # Current number of processed clauses : 1498
% 27.88/3.98 # Positive orientable unit clauses : 12
% 27.88/3.98 # Positive unorientable unit clauses: 0
% 27.88/3.98 # Negative unit clauses : 0
% 27.88/3.98 # Non-unit-clauses : 1486
% 27.88/3.98 # Current number of unprocessed clauses: 226488
% 27.88/3.98 # ...number of literals in the above : 1026586
% 27.88/3.98 # Current number of archived formulas : 0
% 27.88/3.98 # Current number of archived clauses : 2187
% 27.88/3.98 # Clause-clause subsumption calls (NU) : 2369932
% 27.88/3.98 # Rec. Clause-clause subsumption calls : 825816
% 27.88/3.98 # Non-unit clause-clause subsumptions : 10990
% 27.88/3.98 # Unit Clause-clause subsumption calls : 9180
% 27.88/3.98 # Rewrite failures with RHS unbound : 0
% 27.88/3.98 # BW rewrite match attempts : 9
% 27.88/3.98 # BW rewrite match successes : 9
% 27.88/3.98 # Condensation attempts : 0
% 27.88/3.98 # Condensation successes : 0
% 27.88/3.98 # Termbank termtop insertions : 6733431
% 27.88/3.98 # Search garbage collected termcells : 874
% 27.88/3.98
% 27.88/3.98 # -------------------------------------------------
% 27.88/3.98 # User time : 3.238 s
% 27.88/3.98 # System time : 0.129 s
% 27.88/3.98 # Total time : 3.367 s
% 27.88/3.98 # Maximum resident set size: 2120 pages
% 27.88/3.98
% 27.88/3.98 # -------------------------------------------------
% 27.88/3.98 # User time : 3.241 s
% 27.88/3.98 # System time : 0.132 s
% 27.88/3.98 # Total time : 3.373 s
% 27.88/3.98 # Maximum resident set size: 1876 pages
% 27.88/3.98 % E---3.1 exiting
% 27.88/3.99 % E exiting
%------------------------------------------------------------------------------