TSTP Solution File: SWC089-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC089-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:32 EDT 2024
% Result : Unsatisfiable 3.73s 0.96s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 38
% Syntax : Number of clauses : 164 ( 28 unt; 44 nHn; 156 RR)
% Number of literals : 493 ( 159 equ; 300 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 197 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
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(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
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(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(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(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
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(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(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(co1_10,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(c_0_38,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_39,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
c_0_38 ).
cnf(c_0_40,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_41,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_42,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_43,negated_conjecture,
( sk4 = X1
| tl(sk3) != X2
| hd(sk3) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk3)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_42 ).
cnf(c_0_46,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_48,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_49,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| ~ neq(nil,sk3)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
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)],[c_0_43,c_0_44])])])])])]),c_0_45]) ).
cnf(c_0_50,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_46 ).
cnf(c_0_51,axiom,
ssList(nil),
clause8 ).
cnf(c_0_52,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_54,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_55,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_53 ).
cnf(c_0_56,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_57,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_52])]) ).
cnf(c_0_58,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_56 ).
cnf(c_0_59,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_60,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_61,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_62,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_63,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_52])]) ).
cnf(c_0_64,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_59 ).
cnf(c_0_65,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_66,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_60 ).
cnf(c_0_67,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_61 ).
cnf(c_0_68,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_69,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_70,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_62 ).
cnf(c_0_71,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_51])]) ).
cnf(c_0_72,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_73,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_74,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_65 ).
cnf(c_0_75,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_58]),c_0_55]) ).
cnf(c_0_76,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_68 ).
cnf(c_0_77,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_69 ).
cnf(c_0_78,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_79,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_70]),c_0_45]) ).
cnf(c_0_80,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_55]),c_0_52])]) ).
cnf(c_0_81,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_72 ).
cnf(c_0_82,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_73 ).
cnf(c_0_83,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_84,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_85,plain,
( nil = X1
| app(tl(X1),X2) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_45]),c_0_77]) ).
cnf(c_0_86,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_78 ).
cnf(c_0_87,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_88,negated_conjecture,
( sk3 = nil
| frontsegP(sk4,tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,plain,
( tl(X1) = nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_51])]) ).
cnf(c_0_90,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_64]),c_0_51])]) ).
cnf(c_0_91,plain,
( nil = X1
| tl(X1) != app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_51])]),c_0_58]) ).
cnf(c_0_92,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_93,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_94,negated_conjecture,
( sk3 = nil
| frontsegP(sk4,tl(sk3))
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_58]),c_0_52])]) ).
cnf(c_0_95,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_96,plain,
( app(cons(X1,X2),nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_81]),c_0_64]),c_0_92]) ).
cnf(c_0_97,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_93 ).
cnf(c_0_98,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_99,negated_conjecture,
( sk3 = nil
| frontsegP(sk4,tl(sk3))
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_64]),c_0_51])]) ).
cnf(c_0_100,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_101,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_64]),c_0_51])]) ).
cnf(c_0_102,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_51])]) ).
cnf(c_0_103,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_104,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_98 ).
cnf(c_0_105,negated_conjecture,
( sk3 = nil
| frontsegP(sk4,tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_55]),c_0_52])]) ).
cnf(c_0_106,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_100,c_0_41]) ).
cnf(c_0_107,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_101]),c_0_102]) ).
cnf(c_0_108,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_103 ).
cnf(c_0_109,negated_conjecture,
( app(tl(sk3),skaf45(sk4,tl(sk3))) = sk4
| sk3 = nil
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106])]) ).
cnf(c_0_110,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_111,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_64]),c_0_51])]) ).
cnf(c_0_112,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_113,negated_conjecture,
( X1 = cons(hd(sk3),nil)
| sk3 = nil
| app(tl(sk3),X1) != sk4
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_108,c_0_80]) ).
cnf(c_0_114,negated_conjecture,
( app(tl(sk3),skaf45(sk4,tl(sk3))) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_58]),c_0_52])]) ).
cnf(c_0_115,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_116,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_110 ).
cnf(c_0_117,plain,
( ssList(cons(X1,nil))
| ~ ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_111]),c_0_51])]) ).
cnf(c_0_118,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_112 ).
cnf(c_0_119,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_120,negated_conjecture,
( skaf45(sk4,tl(sk3)) = cons(hd(sk3),nil)
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115])]) ).
cnf(c_0_121,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
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,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_51])]) ).
cnf(c_0_124,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
c_0_119 ).
cnf(c_0_125,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_126,negated_conjecture,
( skaf45(sk4,tl(sk3)) = cons(hd(sk3),nil)
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_58]),c_0_52])]) ).
cnf(c_0_127,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_121 ).
cnf(c_0_128,plain,
( segmentP(app(cons(X1,X2),X3),X2)
| ~ ssItem(X1)
| ~ ssList(app(cons(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_97]),c_0_123]) ).
cnf(c_0_129,plain,
( app(X1,skaf45(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_124]) ).
cnf(c_0_130,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_131,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_125 ).
cnf(c_0_132,negated_conjecture,
( skaf45(sk4,tl(sk3)) = cons(hd(sk3),nil)
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_64]),c_0_51])]) ).
cnf(c_0_133,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_48]),c_0_41]) ).
cnf(c_0_134,plain,
( segmentP(cons(X1,X2),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_115])]),c_0_64]) ).
cnf(c_0_135,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_130 ).
cnf(c_0_136,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_137,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_138,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_122,c_0_131]),c_0_51])]),c_0_45]) ).
cnf(c_0_139,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_140,negated_conjecture,
( skaf45(sk4,tl(sk3)) = cons(hd(sk3),nil)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_55]),c_0_52])]) ).
cnf(c_0_141,negated_conjecture,
( nil = X1
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_50]),c_0_51])]) ).
cnf(c_0_142,plain,
( nil = X1
| segmentP(X1,skaf82(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_137])]) ).
cnf(c_0_143,negated_conjecture,
( sk3 = nil
| segmentP(sk4,tl(sk3))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_114]),c_0_115])]) ).
cnf(c_0_144,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
c_0_139 ).
cnf(c_0_145,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_122,c_0_86]),c_0_51])]),c_0_45]) ).
cnf(c_0_146,negated_conjecture,
( sk3 = nil
| ssList(cons(hd(sk3),nil)) ),
inference(spm,[status(thm)],[c_0_115,c_0_140]) ).
cnf(c_0_147,negated_conjecture,
( skaf82(sk3) = nil
| sk3 = nil
| ~ segmentP(sk4,skaf82(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_137]),c_0_52])]) ).
cnf(c_0_148,plain,
( skaf82(X1) = tl(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_135]),c_0_136]),c_0_137])]) ).
cnf(c_0_149,negated_conjecture,
( sk3 = nil
| segmentP(sk4,tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_58]),c_0_52])]) ).
cnf(c_0_150,negated_conjecture,
neq(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_44])]) ).
cnf(c_0_151,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_152,negated_conjecture,
( sk3 = nil
| segmentP(sk4,cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_80]),c_0_146]) ).
cnf(c_0_153,negated_conjecture,
( tl(sk3) = nil
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_52])]),c_0_149]) ).
cnf(c_0_154,negated_conjecture,
( ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_150]),c_0_52])]) ).
cnf(c_0_155,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_151 ).
cnf(c_0_156,negated_conjecture,
( sk3 = nil
| segmentP(sk4,cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_58]),c_0_52])]) ).
cnf(c_0_157,negated_conjecture,
( cons(hd(sk3),nil) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_153]),c_0_52])]) ).
cnf(c_0_158,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_52])]) ).
cnf(c_0_159,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_158]) ).
cnf(c_0_160,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_161,negated_conjecture,
~ segmentP(sk4,nil),
inference(rw,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_162,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_160 ).
cnf(c_0_163,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_162]),c_0_106])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC089-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 02:34:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.73/0.96 # Version: 3.1.0
% 3.73/0.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.73/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/0.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.73/0.96 # Starting new_bool_3 with 300s (1) cores
% 3.73/0.96 # Starting new_bool_1 with 300s (1) cores
% 3.73/0.96 # Starting sh5l with 300s (1) cores
% 3.73/0.96 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18562 completed with status 0
% 3.73/0.96 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.73/0.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.73/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/0.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.73/0.96 # No SInE strategy applied
% 3.73/0.96 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.73/0.96 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.73/0.96 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.73/0.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.73/0.96 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.73/0.96 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.73/0.96 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 3.73/0.96 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 18568 completed with status 0
% 3.73/0.96 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 3.73/0.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 3.73/0.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/0.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.73/0.96 # No SInE strategy applied
% 3.73/0.96 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.73/0.96 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.73/0.96 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.73/0.96 # Preprocessing time : 0.003 s
% 3.73/0.96 # Presaturation interreduction done
% 3.73/0.96
% 3.73/0.96 # Proof found!
% 3.73/0.96 # SZS status Unsatisfiable
% 3.73/0.96 # SZS output start CNFRefutation
% See solution above
% 3.73/0.96 # Parsed axioms : 196
% 3.73/0.96 # Removed by relevancy pruning/SinE : 0
% 3.73/0.96 # Initial clauses : 196
% 3.73/0.96 # Removed in clause preprocessing : 0
% 3.73/0.96 # Initial clauses in saturation : 196
% 3.73/0.96 # Processed clauses : 4189
% 3.73/0.96 # ...of these trivial : 5
% 3.73/0.96 # ...subsumed : 2808
% 3.73/0.96 # ...remaining for further processing : 1376
% 3.73/0.96 # Other redundant clauses eliminated : 238
% 3.73/0.96 # Clauses deleted for lack of memory : 0
% 3.73/0.96 # Backward-subsumed : 265
% 3.73/0.96 # Backward-rewritten : 309
% 3.73/0.96 # Generated clauses : 19922
% 3.73/0.96 # ...of the previous two non-redundant : 19006
% 3.73/0.96 # ...aggressively subsumed : 0
% 3.73/0.96 # Contextual simplify-reflections : 497
% 3.73/0.96 # Paramodulations : 19677
% 3.73/0.96 # Factorizations : 0
% 3.73/0.96 # NegExts : 0
% 3.73/0.96 # Equation resolutions : 249
% 3.73/0.96 # Disequality decompositions : 0
% 3.73/0.96 # Total rewrite steps : 14450
% 3.73/0.96 # ...of those cached : 14143
% 3.73/0.96 # Propositional unsat checks : 0
% 3.73/0.96 # Propositional check models : 0
% 3.73/0.96 # Propositional check unsatisfiable : 0
% 3.73/0.96 # Propositional clauses : 0
% 3.73/0.96 # Propositional clauses after purity: 0
% 3.73/0.96 # Propositional unsat core size : 0
% 3.73/0.96 # Propositional preprocessing time : 0.000
% 3.73/0.96 # Propositional encoding time : 0.000
% 3.73/0.96 # Propositional solver time : 0.000
% 3.73/0.96 # Success case prop preproc time : 0.000
% 3.73/0.96 # Success case prop encoding time : 0.000
% 3.73/0.96 # Success case prop solver time : 0.000
% 3.73/0.96 # Current number of processed clauses : 590
% 3.73/0.96 # Positive orientable unit clauses : 64
% 3.73/0.96 # Positive unorientable unit clauses: 0
% 3.73/0.96 # Negative unit clauses : 4
% 3.73/0.96 # Non-unit-clauses : 522
% 3.73/0.96 # Current number of unprocessed clauses: 15000
% 3.73/0.96 # ...number of literals in the above : 95112
% 3.73/0.96 # Current number of archived formulas : 0
% 3.73/0.96 # Current number of archived clauses : 762
% 3.73/0.96 # Clause-clause subsumption calls (NU) : 207567
% 3.73/0.96 # Rec. Clause-clause subsumption calls : 55476
% 3.73/0.96 # Non-unit clause-clause subsumptions : 3171
% 3.73/0.96 # Unit Clause-clause subsumption calls : 637
% 3.73/0.96 # Rewrite failures with RHS unbound : 0
% 3.73/0.96 # BW rewrite match attempts : 5
% 3.73/0.96 # BW rewrite match successes : 5
% 3.73/0.96 # Condensation attempts : 0
% 3.73/0.96 # Condensation successes : 0
% 3.73/0.96 # Termbank termtop insertions : 442086
% 3.73/0.96 # Search garbage collected termcells : 563
% 3.73/0.96
% 3.73/0.96 # -------------------------------------------------
% 3.73/0.96 # User time : 0.432 s
% 3.73/0.96 # System time : 0.016 s
% 3.73/0.96 # Total time : 0.448 s
% 3.73/0.96 # Maximum resident set size: 2148 pages
% 3.73/0.96
% 3.73/0.96 # -------------------------------------------------
% 3.73/0.96 # User time : 2.155 s
% 3.73/0.96 # System time : 0.111 s
% 3.73/0.96 # Total time : 2.265 s
% 3.73/0.96 # Maximum resident set size: 1876 pages
% 3.73/0.96 % E---3.1 exiting
%------------------------------------------------------------------------------