TSTP Solution File: SWC087-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC087-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:25 EDT 2023
% Result : Unsatisfiable 39.57s 5.45s
% Output : CNFRefutation 39.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 26
% Syntax : Number of clauses : 108 ( 24 unt; 17 nHn; 108 RR)
% Number of literals : 348 ( 84 equ; 234 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 : 155 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause151) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause149) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',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/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause173) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause145) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause74) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_5) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause100) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_7) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause98) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause157) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_1) ).
cnf(clause152,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',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/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause172) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',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/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',co1_6) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause76) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.JquQI9UNec/E---3.1_26974.p',clause79) ).
cnf(c_0_26,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_27,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_28,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_29,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_30,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,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_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_34,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_35,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_36,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_37,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_29]) ).
cnf(c_0_38,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]),c_0_31])]) ).
cnf(c_0_39,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_32,c_0_33]),c_0_31])]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_42,plain,
( X1 = app(X2,X3)
| neq(app(X2,X3),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_43,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_44,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_45,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_46,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause152 ).
cnf(c_0_47,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_37,c_0_33]),c_0_31])]),c_0_28]) ).
cnf(c_0_48,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_49,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_28]) ).
cnf(c_0_50,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_27,c_0_38]),c_0_31])]) ).
cnf(c_0_51,negated_conjecture,
( app(X1,nil) = sk4
| app(X1,X2) != app(sk4,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,negated_conjecture,
neq(sk2,nil),
c_0_41 ).
cnf(c_0_53,plain,
( app(X1,X2) = nil
| neq(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_54,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_55,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28]) ).
cnf(c_0_56,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_57,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) ),
co1_12 ).
cnf(c_0_58,negated_conjecture,
( app(X1,nil) = sk1
| app(X1,X2) != app(sk1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_59,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_46,c_0_47]),c_0_28]) ).
cnf(c_0_60,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_48,c_0_38]),c_0_31])]) ).
cnf(c_0_61,plain,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_31])]) ).
cnf(c_0_62,negated_conjecture,
( app(sk4,nil) = sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_40])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_64,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_52,c_0_35]) ).
cnf(c_0_65,plain,
( neq(app(cons(X1,X2),X3),nil)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_66,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_44,c_0_38]),c_0_31])]) ).
cnf(c_0_67,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_28]) ).
cnf(c_0_68,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_37,c_0_56]),c_0_31])]),c_0_28]) ).
cnf(c_0_69,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_57]) ).
cnf(c_0_70,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_71,negated_conjecture,
( app(sk1,nil) = sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_58]),c_0_45])]) ).
cnf(c_0_72,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_59,c_0_60]),c_0_28]),c_0_61]) ).
cnf(c_0_73,negated_conjecture,
app(sk4,nil) = sk4,
inference(spm,[status(thm)],[c_0_62,c_0_40]) ).
cnf(c_0_74,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_56,c_0_27]),c_0_31])]),c_0_28]) ).
cnf(c_0_75,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_38]),c_0_31])]) ).
cnf(c_0_76,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_63,c_0_35]),c_0_64])]) ).
cnf(c_0_77,plain,
( neq(cons(X1,nil),nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_31])]) ).
cnf(c_0_78,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_31])]) ).
cnf(c_0_79,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_46,c_0_68]),c_0_28]) ).
cnf(c_0_80,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_69,c_0_70]),c_0_64])])])])])]),c_0_28]) ).
cnf(c_0_81,negated_conjecture,
app(sk1,nil) = sk1,
inference(spm,[status(thm)],[c_0_71,c_0_40]) ).
cnf(c_0_82,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_83,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_84,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_85,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_86,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_72,c_0_73]),c_0_40]),c_0_31])]) ).
cnf(c_0_87,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_33,c_0_74]),c_0_31])]),c_0_75]) ).
cnf(c_0_88,negated_conjecture,
( ~ segmentP(sk1,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_64]),c_0_40])]) ).
cnf(c_0_89,negated_conjecture,
segmentP(sk4,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_73]),c_0_31]),c_0_40])]) ).
cnf(c_0_90,negated_conjecture,
( ~ segmentP(sk1,cons(X1,nil))
| ~ segmentP(sk4,cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_91,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_79,c_0_80]),c_0_78]) ).
cnf(c_0_92,negated_conjecture,
segmentP(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_81]),c_0_31]),c_0_45])]) ).
cnf(c_0_93,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_82]),c_0_78]) ).
cnf(c_0_94,negated_conjecture,
( cons(hd(sk4),tl(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_83,c_0_40]) ).
cnf(c_0_95,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_84,c_0_40]) ).
cnf(c_0_96,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_85,c_0_40]) ).
cnf(c_0_97,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_98,negated_conjecture,
( segmentP(app(X1,nil),sk4)
| ~ segmentP(nil,sk4)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_99,negated_conjecture,
~ segmentP(sk1,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_89])]) ).
cnf(c_0_100,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_90,c_0_91]),c_0_92]),c_0_45])]) ).
cnf(c_0_101,negated_conjecture,
( sk4 = nil
| segmentP(sk4,cons(hd(sk4),nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96]) ).
cnf(c_0_102,negated_conjecture,
( sk4 = nil
| neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_97,c_0_40]) ).
cnf(c_0_103,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_104,negated_conjecture,
~ segmentP(nil,sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_81]),c_0_45])]),c_0_99]) ).
cnf(c_0_105,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_95]),c_0_96]),c_0_102]) ).
cnf(c_0_106,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_103]),c_0_31])]) ).
cnf(c_0_107,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105]),c_0_106])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC087-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 01:56:53 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/tmp/tmp.JquQI9UNec/E---3.1_26974.p
% 39.57/5.45 # Version: 3.1pre001
% 39.57/5.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.57/5.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.57/5.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.57/5.45 # Starting new_bool_3 with 300s (1) cores
% 39.57/5.45 # Starting new_bool_1 with 300s (1) cores
% 39.57/5.45 # Starting sh5l with 300s (1) cores
% 39.57/5.45 # new_bool_1 with pid 27053 completed with status 0
% 39.57/5.45 # Result found by new_bool_1
% 39.57/5.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.57/5.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.57/5.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.57/5.45 # Starting new_bool_3 with 300s (1) cores
% 39.57/5.45 # Starting new_bool_1 with 300s (1) cores
% 39.57/5.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 39.57/5.45 # Search class: FGHSF-FFMM21-MFFFFFNN
% 39.57/5.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 39.57/5.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 39.57/5.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27055 completed with status 0
% 39.57/5.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 39.57/5.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 39.57/5.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.57/5.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 39.57/5.45 # Starting new_bool_3 with 300s (1) cores
% 39.57/5.45 # Starting new_bool_1 with 300s (1) cores
% 39.57/5.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 39.57/5.45 # Search class: FGHSF-FFMM21-MFFFFFNN
% 39.57/5.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 39.57/5.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 39.57/5.45 # Preprocessing time : 0.005 s
% 39.57/5.45 # Presaturation interreduction done
% 39.57/5.45
% 39.57/5.45 # Proof found!
% 39.57/5.45 # SZS status Unsatisfiable
% 39.57/5.45 # SZS output start CNFRefutation
% See solution above
% 39.57/5.45 # Parsed axioms : 197
% 39.57/5.45 # Removed by relevancy pruning/SinE : 121
% 39.57/5.45 # Initial clauses : 76
% 39.57/5.45 # Removed in clause preprocessing : 0
% 39.57/5.45 # Initial clauses in saturation : 76
% 39.57/5.45 # Processed clauses : 13392
% 39.57/5.45 # ...of these trivial : 56
% 39.57/5.45 # ...subsumed : 9635
% 39.57/5.45 # ...remaining for further processing : 3701
% 39.57/5.45 # Other redundant clauses eliminated : 79
% 39.57/5.45 # Clauses deleted for lack of memory : 0
% 39.57/5.45 # Backward-subsumed : 176
% 39.57/5.45 # Backward-rewritten : 1950
% 39.57/5.45 # Generated clauses : 246049
% 39.57/5.45 # ...of the previous two non-redundant : 243431
% 39.57/5.45 # ...aggressively subsumed : 0
% 39.57/5.45 # Contextual simplify-reflections : 1280
% 39.57/5.45 # Paramodulations : 245905
% 39.57/5.45 # Factorizations : 0
% 39.57/5.45 # NegExts : 0
% 39.57/5.45 # Equation resolutions : 148
% 39.57/5.45 # Total rewrite steps : 71928
% 39.57/5.45 # Propositional unsat checks : 0
% 39.57/5.45 # Propositional check models : 0
% 39.57/5.45 # Propositional check unsatisfiable : 0
% 39.57/5.45 # Propositional clauses : 0
% 39.57/5.45 # Propositional clauses after purity: 0
% 39.57/5.45 # Propositional unsat core size : 0
% 39.57/5.45 # Propositional preprocessing time : 0.000
% 39.57/5.45 # Propositional encoding time : 0.000
% 39.57/5.45 # Propositional solver time : 0.000
% 39.57/5.45 # Success case prop preproc time : 0.000
% 39.57/5.45 # Success case prop encoding time : 0.000
% 39.57/5.45 # Success case prop solver time : 0.000
% 39.57/5.45 # Current number of processed clauses : 1499
% 39.57/5.45 # Positive orientable unit clauses : 12
% 39.57/5.45 # Positive unorientable unit clauses: 0
% 39.57/5.45 # Negative unit clauses : 0
% 39.57/5.45 # Non-unit-clauses : 1487
% 39.57/5.45 # Current number of unprocessed clauses: 228325
% 39.57/5.45 # ...number of literals in the above : 1034373
% 39.57/5.45 # Current number of archived formulas : 0
% 39.57/5.45 # Current number of archived clauses : 2191
% 39.57/5.45 # Clause-clause subsumption calls (NU) : 2366166
% 39.57/5.45 # Rec. Clause-clause subsumption calls : 825780
% 39.57/5.45 # Non-unit clause-clause subsumptions : 10973
% 39.57/5.45 # Unit Clause-clause subsumption calls : 9181
% 39.57/5.45 # Rewrite failures with RHS unbound : 0
% 39.57/5.45 # BW rewrite match attempts : 9
% 39.57/5.45 # BW rewrite match successes : 9
% 39.57/5.45 # Condensation attempts : 0
% 39.57/5.45 # Condensation successes : 0
% 39.57/5.45 # Termbank termtop insertions : 6775285
% 39.57/5.45
% 39.57/5.45 # -------------------------------------------------
% 39.57/5.45 # User time : 4.742 s
% 39.57/5.45 # System time : 0.145 s
% 39.57/5.45 # Total time : 4.887 s
% 39.57/5.45 # Maximum resident set size: 2124 pages
% 39.57/5.45
% 39.57/5.45 # -------------------------------------------------
% 39.57/5.45 # User time : 4.746 s
% 39.57/5.45 # System time : 0.146 s
% 39.57/5.45 # Total time : 4.892 s
% 39.57/5.45 # Maximum resident set size: 1852 pages
% 39.57/5.45 % E---3.1 exiting
%------------------------------------------------------------------------------