TSTP Solution File: SWC119-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC119-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:35 EDT 2023
% Result : Unsatisfiable 8.53s 1.63s
% Output : CNFRefutation 8.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 39
% Syntax : Number of clauses : 134 ( 38 unt; 18 nHn; 128 RR)
% Number of literals : 341 ( 114 equ; 200 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 152 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_2) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_7) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause138) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause8) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_9) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause120) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause169) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_1) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause97) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause144) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause123) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause53) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause86) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause52) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause151) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause131) ).
cnf(clause129,axiom,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause129) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause104) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause50) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause75) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause150) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause98) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause96) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause74) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause118) ).
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.41MSqH7gny/E---3.1_11349.p',clause157) ).
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.41MSqH7gny/E---3.1_11349.p',clause173) ).
cnf(co1_11,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_11) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause172) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',co1_12) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.41MSqH7gny/E---3.1_11349.p',clause73) ).
cnf(c_0_39,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_8 ).
cnf(c_0_40,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_41,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_42,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_43,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_44,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_45,negated_conjecture,
( sk1 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_47,negated_conjecture,
( cons(sk5,nil) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_49,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_43,c_0_40]) ).
cnf(c_0_50,axiom,
ssList(nil),
clause8 ).
cnf(c_0_51,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_42]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_53,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_54,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_48]),c_0_49]),c_0_50])]),c_0_51]) ).
cnf(c_0_56,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_57,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_58,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_59,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_60,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_50])]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_62,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_63,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_56]),c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( app(sk1,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_54]),c_0_55])]) ).
cnf(c_0_65,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_66,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_67,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_55]),c_0_61])]) ).
cnf(c_0_68,negated_conjecture,
hd(sk1) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_54]),c_0_55]),c_0_50])]) ).
cnf(c_0_69,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_70,negated_conjecture,
( rearsegP(cons(sk5,X1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_61])]) ).
cnf(c_0_71,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_65]),c_0_57]) ).
cnf(c_0_72,negated_conjecture,
( hd(skaf42(sk1,sk5)) = sk5
| skaf42(sk1,sk5) = nil
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69])]) ).
cnf(c_0_73,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_74,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_75,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_76,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_77,negated_conjecture,
rearsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_54]),c_0_50])]) ).
cnf(c_0_78,axiom,
( X2 = X1
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause129 ).
cnf(c_0_79,negated_conjecture,
( frontsegP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_64]),c_0_61])]) ).
cnf(c_0_80,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_64]),c_0_61])]) ).
cnf(c_0_81,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_82,negated_conjecture,
( hd(skaf42(sk1,sk5)) = sk5
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_55]),c_0_74])]) ).
cnf(c_0_83,negated_conjecture,
( frontsegP(sk1,skaf42(sk1,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_67]),c_0_69])]) ).
cnf(c_0_84,negated_conjecture,
( X1 = sk1
| app(X1,X2) != cons(sk5,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_64]),c_0_61])]) ).
cnf(c_0_85,negated_conjecture,
app(skaf46(sk1,nil),nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_50]),c_0_61])]) ).
cnf(c_0_86,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_87,negated_conjecture,
( cons(sk5,X1) = sk1
| ~ frontsegP(sk1,cons(sk5,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_61])]),c_0_80]) ).
cnf(c_0_88,negated_conjecture,
( cons(sk5,tl(skaf42(sk1,sk5))) = skaf42(sk1,sk5)
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_69])]) ).
cnf(c_0_89,negated_conjecture,
frontsegP(sk1,skaf42(sk1,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_73]),c_0_55]),c_0_74])]) ).
cnf(c_0_90,negated_conjecture,
skaf46(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_54]),c_0_50]),c_0_86])]) ).
cnf(c_0_91,negated_conjecture,
( skaf42(sk1,sk5) = nil
| skaf42(sk1,sk5) = sk1
| ~ ssList(tl(skaf42(sk1,sk5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).
cnf(c_0_92,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_93,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_94,negated_conjecture,
app(sk1,nil) = sk1,
inference(rw,[status(thm)],[c_0_85,c_0_90]) ).
cnf(c_0_95,negated_conjecture,
( skaf42(sk1,sk5) = sk1
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_69])]) ).
cnf(c_0_96,negated_conjecture,
( nil = X1
| app(sk1,X1) != sk1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_50]),c_0_61])]) ).
cnf(c_0_97,negated_conjecture,
( app(sk1,cons(sk5,skaf43(sk5,sk1))) = sk1
| skaf42(sk1,sk5) = nil ),
inference(spm,[status(thm)],[c_0_67,c_0_95]) ).
cnf(c_0_98,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) = nil
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_99,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_100,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = nil
| skaf42(sk1,sk5) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_73]),c_0_55]),c_0_74])]) ).
cnf(c_0_101,negated_conjecture,
skaf42(sk1,sk5) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_55]),c_0_74])]) ).
cnf(c_0_102,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_103,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_104,negated_conjecture,
app(nil,cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(rw,[status(thm)],[c_0_67,c_0_101]) ).
cnf(c_0_105,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_106,negated_conjecture,
tl(sk1) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_54]),c_0_55]),c_0_50])]) ).
cnf(c_0_107,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_54]),c_0_55]),c_0_50])]) ).
cnf(c_0_108,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_109,negated_conjecture,
( cons(sk5,skaf43(sk5,sk1)) = sk1
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_110,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_111,negated_conjecture,
( tl(cons(sk5,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_64]),c_0_106]),c_0_61])]),c_0_107]) ).
cnf(c_0_112,negated_conjecture,
( cons(sk5,X1) != nil
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_64]),c_0_61])]),c_0_107]) ).
cnf(c_0_113,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_114,negated_conjecture,
cons(sk5,skaf43(sk5,sk1)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_73]),c_0_55]),c_0_74])]) ).
cnf(c_0_115,negated_conjecture,
( cons(sk5,app(nil,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_54]),c_0_55]),c_0_50])]) ).
cnf(c_0_116,negated_conjecture,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_111]),c_0_80]),c_0_112]) ).
cnf(c_0_117,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_113]) ).
cnf(c_0_118,negated_conjecture,
app(nil,sk1) = sk1,
inference(rw,[status(thm)],[c_0_104,c_0_114]) ).
cnf(c_0_119,negated_conjecture,
( ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_115]),c_0_55])]),c_0_116]) ).
cnf(c_0_120,negated_conjecture,
( segmentP(app(sk1,X1),sk1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_61]),c_0_50])]),c_0_119]) ).
cnf(c_0_121,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_122,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_123,negated_conjecture,
( segmentP(cons(sk5,X1),sk1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_120,c_0_64]) ).
cnf(c_0_124,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_48]),c_0_49]),c_0_50])]),c_0_51]) ).
cnf(c_0_125,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
co1_12 ).
cnf(c_0_126,negated_conjecture,
( segmentP(app(app(X1,cons(sk5,X2)),X3),sk1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_61])]),c_0_80]) ).
cnf(c_0_127,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_124]),c_0_55]),c_0_49])]) ).
cnf(c_0_128,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_125,c_0_40]) ).
cnf(c_0_129,negated_conjecture,
( segmentP(app(sk4,X1),sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_69]),c_0_74])]) ).
cnf(c_0_130,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_131,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_48]),c_0_61]),c_0_50])]) ).
cnf(c_0_132,negated_conjecture,
segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_50]),c_0_49])]) ).
cnf(c_0_133,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_132])]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC119-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.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 : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:00:46 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 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.41MSqH7gny/E---3.1_11349.p
% 8.53/1.63 # Version: 3.1pre001
% 8.53/1.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.53/1.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.53/1.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.53/1.63 # Starting new_bool_3 with 300s (1) cores
% 8.53/1.63 # Starting new_bool_1 with 300s (1) cores
% 8.53/1.63 # Starting sh5l with 300s (1) cores
% 8.53/1.63 # sh5l with pid 11465 completed with status 0
% 8.53/1.63 # Result found by sh5l
% 8.53/1.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.53/1.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.53/1.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.53/1.63 # Starting new_bool_3 with 300s (1) cores
% 8.53/1.63 # Starting new_bool_1 with 300s (1) cores
% 8.53/1.63 # Starting sh5l with 300s (1) cores
% 8.53/1.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.53/1.63 # Search class: FGHSM-FSLM21-MFFFFFNN
% 8.53/1.63 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 8.53/1.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 8.53/1.63 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 11476 completed with status 0
% 8.53/1.63 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 8.53/1.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.53/1.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.53/1.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.53/1.63 # Starting new_bool_3 with 300s (1) cores
% 8.53/1.63 # Starting new_bool_1 with 300s (1) cores
% 8.53/1.63 # Starting sh5l with 300s (1) cores
% 8.53/1.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.53/1.63 # Search class: FGHSM-FSLM21-MFFFFFNN
% 8.53/1.63 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 8.53/1.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 8.53/1.63 # Preprocessing time : 0.003 s
% 8.53/1.63 # Presaturation interreduction done
% 8.53/1.63
% 8.53/1.63 # Proof found!
% 8.53/1.63 # SZS status Unsatisfiable
% 8.53/1.63 # SZS output start CNFRefutation
% See solution above
% 8.53/1.63 # Parsed axioms : 197
% 8.53/1.63 # Removed by relevancy pruning/SinE : 33
% 8.53/1.63 # Initial clauses : 164
% 8.53/1.63 # Removed in clause preprocessing : 0
% 8.53/1.63 # Initial clauses in saturation : 164
% 8.53/1.63 # Processed clauses : 11503
% 8.53/1.63 # ...of these trivial : 184
% 8.53/1.63 # ...subsumed : 8589
% 8.53/1.63 # ...remaining for further processing : 2730
% 8.53/1.63 # Other redundant clauses eliminated : 312
% 8.53/1.63 # Clauses deleted for lack of memory : 0
% 8.53/1.63 # Backward-subsumed : 130
% 8.53/1.63 # Backward-rewritten : 250
% 8.53/1.63 # Generated clauses : 58239
% 8.53/1.63 # ...of the previous two non-redundant : 50593
% 8.53/1.63 # ...aggressively subsumed : 0
% 8.53/1.63 # Contextual simplify-reflections : 533
% 8.53/1.63 # Paramodulations : 57893
% 8.53/1.63 # Factorizations : 2
% 8.53/1.63 # NegExts : 0
% 8.53/1.63 # Equation resolutions : 339
% 8.53/1.63 # Total rewrite steps : 87191
% 8.53/1.63 # Propositional unsat checks : 0
% 8.53/1.63 # Propositional check models : 0
% 8.53/1.63 # Propositional check unsatisfiable : 0
% 8.53/1.63 # Propositional clauses : 0
% 8.53/1.63 # Propositional clauses after purity: 0
% 8.53/1.63 # Propositional unsat core size : 0
% 8.53/1.63 # Propositional preprocessing time : 0.000
% 8.53/1.63 # Propositional encoding time : 0.000
% 8.53/1.63 # Propositional solver time : 0.000
% 8.53/1.63 # Success case prop preproc time : 0.000
% 8.53/1.63 # Success case prop encoding time : 0.000
% 8.53/1.63 # Success case prop solver time : 0.000
% 8.53/1.63 # Current number of processed clauses : 2169
% 8.53/1.63 # Positive orientable unit clauses : 375
% 8.53/1.63 # Positive unorientable unit clauses: 0
% 8.53/1.63 # Negative unit clauses : 205
% 8.53/1.63 # Non-unit-clauses : 1589
% 8.53/1.63 # Current number of unprocessed clauses: 38709
% 8.53/1.63 # ...number of literals in the above : 210168
% 8.53/1.63 # Current number of archived formulas : 0
% 8.53/1.63 # Current number of archived clauses : 541
% 8.53/1.63 # Clause-clause subsumption calls (NU) : 536112
% 8.53/1.63 # Rec. Clause-clause subsumption calls : 152243
% 8.53/1.63 # Non-unit clause-clause subsumptions : 4567
% 8.53/1.63 # Unit Clause-clause subsumption calls : 21345
% 8.53/1.63 # Rewrite failures with RHS unbound : 0
% 8.53/1.63 # BW rewrite match attempts : 803
% 8.53/1.63 # BW rewrite match successes : 111
% 8.53/1.63 # Condensation attempts : 0
% 8.53/1.63 # Condensation successes : 0
% 8.53/1.63 # Termbank termtop insertions : 1518044
% 8.53/1.63
% 8.53/1.63 # -------------------------------------------------
% 8.53/1.63 # User time : 1.028 s
% 8.53/1.63 # System time : 0.040 s
% 8.53/1.63 # Total time : 1.068 s
% 8.53/1.63 # Maximum resident set size: 2180 pages
% 8.53/1.63
% 8.53/1.63 # -------------------------------------------------
% 8.53/1.63 # User time : 1.032 s
% 8.53/1.63 # System time : 0.042 s
% 8.53/1.63 # Total time : 1.074 s
% 8.53/1.63 # Maximum resident set size: 1852 pages
% 8.53/1.63 % E---3.1 exiting
%------------------------------------------------------------------------------