TSTP Solution File: SWC015-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC015-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:26:56 EDT 2024
% Result : Unsatisfiable 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 24
% Syntax : Number of clauses : 107 ( 21 unt; 43 nHn; 105 RR)
% Number of literals : 320 ( 140 equ; 173 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 114 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
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(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
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(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(co1_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,nil) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(c_0_24,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_25,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_26,negated_conjecture,
neq(sk2,nil),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_28,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_33,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(app(sk1,tl(sk4)))
| ~ ssList(tl(sk4)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30])])])]) ).
cnf(c_0_34,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_37,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_38,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| nil = sk4
| ~ ssList(app(sk1,tl(sk4)))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_37 ).
cnf(c_0_40,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_41,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_42,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| nil = sk4
| ~ ssList(app(sk1,tl(sk4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36])]) ).
cnf(c_0_43,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_40 ).
cnf(c_0_44,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_45,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_41 ).
cnf(c_0_46,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| nil = sk4
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_47,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_39]),c_0_36])]) ).
cnf(c_0_49,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_50,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_51,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk1)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_44])]) ).
cnf(c_0_52,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_53,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_49 ).
cnf(c_0_54,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_55,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_36])]) ).
cnf(c_0_56,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_52 ).
cnf(c_0_57,negated_conjecture,
( tl(sk4) = X1
| nil = sk4
| app(sk1,X1) != sk4
| ~ ssList(tl(sk4))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_48]),c_0_44])]) ).
cnf(c_0_58,negated_conjecture,
( app(sk1,skaf45(sk4,sk1)) = sk4
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_44]),c_0_36])]) ).
cnf(c_0_59,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_60,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_61,negated_conjecture,
( hd(sk4) = hd(sk1)
| nil = sk4
| nil = sk1
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_48]),c_0_44])]) ).
cnf(c_0_62,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_63,negated_conjecture,
( skaf45(sk4,sk1) = tl(sk4)
| nil = sk4
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_64,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_65,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_60 ).
cnf(c_0_66,negated_conjecture,
( hd(sk4) = hd(sk1)
| nil = sk1
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_39]),c_0_36])]) ).
cnf(c_0_67,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_62 ).
cnf(c_0_68,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_69,negated_conjecture,
( skaf45(sk4,sk1) = tl(sk4)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_39]),c_0_36])]) ).
cnf(c_0_70,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_64 ).
cnf(c_0_71,negated_conjecture,
( cons(hd(sk1),tl(sk4)) = sk4
| nil = sk1
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_36])]) ).
cnf(c_0_72,negated_conjecture,
( nil = sk1
| nil = sk4
| ssItem(hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_36])]) ).
cnf(c_0_73,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_68 ).
cnf(c_0_74,negated_conjecture,
( nil = sk4
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_59,c_0_69]) ).
cnf(c_0_75,negated_conjecture,
( app(cons(hd(sk1),nil),tl(sk4)) = sk4
| nil = sk4
| nil = sk1
| ~ ssList(tl(sk4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,nil) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_77,negated_conjecture,
( nil = sk4
| sk1 = X1
| app(X1,tl(sk4)) != sk4
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_48]),c_0_44])]),c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( app(cons(hd(sk1),nil),tl(sk4)) = sk4
| nil = sk1
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_39]),c_0_36])]) ).
cnf(c_0_79,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,nil) != sk1
| app(cons(X1,nil),X2) != sk2
| ~ neq(sk4,nil) ),
c_0_76 ).
cnf(c_0_81,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| nil = sk1
| nil = sk4
| ~ ssList(cons(hd(sk1),nil)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_79 ).
cnf(c_0_83,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| cons(X1,nil) != sk1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_27]),c_0_30])]) ).
cnf(c_0_84,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| nil = sk4
| nil = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_35])]),c_0_72]) ).
cnf(c_0_85,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_86,negated_conjecture,
( nil = sk1
| nil = sk4
| app(sk1,X1) != sk4
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_72]) ).
cnf(c_0_87,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_85 ).
cnf(c_0_88,negated_conjecture,
( nil = sk4
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_58]),c_0_59])]) ).
cnf(c_0_89,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_87]) ).
cnf(c_0_90,negated_conjecture,
( nil = sk1
| neq(sk4,sk4) ),
inference(spm,[status(thm)],[c_0_30,c_0_88]) ).
cnf(c_0_91,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_92,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_93,negated_conjecture,
nil = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_36])]) ).
cnf(c_0_94,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_91 ).
cnf(c_0_95,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_92 ).
cnf(c_0_96,negated_conjecture,
( app(sk1,skaf45(sk4,sk1)) = sk4
| sk4 = sk1 ),
inference(rw,[status(thm)],[c_0_58,c_0_93]) ).
cnf(c_0_97,plain,
( app(sk1,X1) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_94,c_0_93]) ).
cnf(c_0_98,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_65]),c_0_39]),c_0_67]) ).
cnf(c_0_99,negated_conjecture,
( skaf45(sk4,sk1) = tl(sk4)
| sk4 = sk1 ),
inference(rw,[status(thm)],[c_0_69,c_0_93]) ).
cnf(c_0_100,negated_conjecture,
( skaf45(sk4,sk1) = sk4
| sk4 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_59])]) ).
cnf(c_0_101,plain,
( sk1 = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_98,c_0_93]) ).
cnf(c_0_102,negated_conjecture,
( tl(sk4) = sk4
| sk4 = sk1 ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,negated_conjecture,
neq(sk4,sk1),
inference(rw,[status(thm)],[c_0_30,c_0_93]) ).
cnf(c_0_104,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_36])]) ).
cnf(c_0_105,negated_conjecture,
neq(sk1,sk1),
inference(rw,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_106,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_105]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC015-1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.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:34:22 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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
% 0.19/0.53 # Version: 3.1.0
% 0.19/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25890 completed with status 0
% 0.19/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.53 # No SInE strategy applied
% 0.19/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.19/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.19/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.19/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.19/0.53 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 25898 completed with status 0
% 0.19/0.53 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.19/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.53 # No SInE strategy applied
% 0.19/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.19/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.19/0.53 # Preprocessing time : 0.003 s
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Unsatisfiable
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 197
% 0.19/0.53 # Removed by relevancy pruning/SinE : 0
% 0.19/0.53 # Initial clauses : 197
% 0.19/0.53 # Removed in clause preprocessing : 0
% 0.19/0.53 # Initial clauses in saturation : 197
% 0.19/0.53 # Processed clauses : 527
% 0.19/0.53 # ...of these trivial : 8
% 0.19/0.53 # ...subsumed : 153
% 0.19/0.53 # ...remaining for further processing : 366
% 0.19/0.53 # Other redundant clauses eliminated : 85
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 30
% 0.19/0.53 # Backward-rewritten : 119
% 0.19/0.53 # Generated clauses : 1390
% 0.19/0.53 # ...of the previous two non-redundant : 1289
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 27
% 0.19/0.53 # Paramodulations : 1298
% 0.19/0.53 # Factorizations : 1
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 93
% 0.19/0.53 # Disequality decompositions : 0
% 0.19/0.53 # Total rewrite steps : 1334
% 0.19/0.53 # ...of those cached : 1250
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 193
% 0.19/0.53 # Positive orientable unit clauses : 63
% 0.19/0.53 # Positive unorientable unit clauses: 0
% 0.19/0.53 # Negative unit clauses : 2
% 0.19/0.53 # Non-unit-clauses : 128
% 0.19/0.53 # Current number of unprocessed clauses: 939
% 0.19/0.53 # ...number of literals in the above : 5176
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 149
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 10026
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 1820
% 0.19/0.53 # Non-unit clause-clause subsumptions : 163
% 0.19/0.53 # Unit Clause-clause subsumption calls : 115
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 4
% 0.19/0.53 # BW rewrite match successes : 4
% 0.19/0.53 # Condensation attempts : 0
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 31784
% 0.19/0.53 # Search garbage collected termcells : 559
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.053 s
% 0.19/0.53 # System time : 0.005 s
% 0.19/0.53 # Total time : 0.058 s
% 0.19/0.53 # Maximum resident set size: 2152 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.261 s
% 0.19/0.53 # System time : 0.020 s
% 0.19/0.53 # Total time : 0.282 s
% 0.19/0.53 # Maximum resident set size: 1876 pages
% 0.19/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------