TSTP Solution File: SWC374-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC374-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:40:41 EDT 2023
% Result : Unsatisfiable 1507.90s 193.01s
% Output : CNFRefutation 1507.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 45
% Syntax : Number of clauses : 146 ( 33 unt; 26 nHn; 130 RR)
% Number of literals : 409 ( 116 equ; 268 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 213 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause53) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause85) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause138) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause116) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause72) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause86) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_6) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause120) ).
cnf(co1_12,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_9) ).
cnf(co1_7,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_5) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause145) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_2) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause151) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause76) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause56) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause149) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause118) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause140) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause131) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause50) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause58) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause71) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause73) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause74) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause96) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause98) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause157) ).
cnf(co1_13,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_13) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause173) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',clause97) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_10) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p',co1_8) ).
cnf(c_0_45,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_47,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_48,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_49,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_50,plain,
( ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,cons(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_51,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_52,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_53,axiom,
ssList(nil),
clause8 ).
cnf(c_0_54,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_55,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_56,plain,
( ~ memberP(X1,skaf44(X2))
| ~ singletonP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ duplicatefreeP(app(X1,X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_57,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_58,plain,
( ~ singletonP(X1)
| ~ ssList(cons(skaf44(X1),X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ duplicatefreeP(app(cons(skaf44(X1),X2),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_52])]) ).
cnf(c_0_59,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_60,plain,
( ~ singletonP(X1)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_51]),c_0_53])]) ).
cnf(c_0_61,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_62,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_63,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_64,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_65,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_66,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ duplicatefreeP(app(cons(X1,nil),cons(X1,nil))) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_68,plain,
( ssItem(X1)
| duplicatefreeP(cons(X2,X3))
| ~ ssItem(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ duplicatefreeP(cons(X1,cons(X1,nil))) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_12 ).
cnf(c_0_72,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_9 ).
cnf(c_0_73,negated_conjecture,
~ segmentP(sk2,sk1),
co1_7 ).
cnf(c_0_74,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_75,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(X2,sk3))
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_76,negated_conjecture,
( sk3 = nil
| ~ duplicatefreeP(cons(sk5,sk3)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_69])]),c_0_72]) ).
cnf(c_0_77,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_78,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74]),c_0_65]) ).
cnf(c_0_79,negated_conjecture,
( sk3 = nil
| ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_72]),c_0_76]) ).
cnf(c_0_80,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_81,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_82,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_77])]),c_0_53])]) ).
cnf(c_0_83,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_84,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_85,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_86,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_87,negated_conjecture,
( ssItem(X1)
| ~ segmentP(sk4,nil) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_89,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_80,c_0_74]) ).
cnf(c_0_90,plain,
( X1 = nil
| app(X1,nil) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_53])]) ).
cnf(c_0_91,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_92,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86]) ).
cnf(c_0_93,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_94,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_95,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_96,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).
cnf(c_0_97,plain,
( app(X1,X2) = nil
| app(X1,app(X2,nil)) != nil
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_53])]),c_0_54]) ).
cnf(c_0_98,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_99,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_100,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_101,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_102,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_103,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_91]),c_0_54]) ).
cnf(c_0_104,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_92,c_0_93]),c_0_54]),c_0_94]) ).
cnf(c_0_105,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_106,plain,
( app(X1,skaf46(X2,nil)) = nil
| app(X1,X2) != nil
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),c_0_53])]),c_0_100]) ).
cnf(c_0_107,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_96])]) ).
cnf(c_0_108,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_109,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_102,c_0_91]),c_0_53])]),c_0_54]) ).
cnf(c_0_110,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_82]),c_0_53])]) ).
cnf(c_0_111,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_104,c_0_102]),c_0_53])]),c_0_85]) ).
cnf(c_0_112,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_113,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_114,plain,
( app(X1,X2) != nil
| ~ memberP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_99])]),c_0_107]) ).
cnf(c_0_115,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_108,c_0_109]),c_0_53])]),c_0_110]) ).
cnf(c_0_116,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_111,c_0_112]),c_0_63]),c_0_113]) ).
cnf(c_0_117,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_118,plain,
( app(nil,X1) != nil
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_53])]) ).
cnf(c_0_119,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_13 ).
cnf(c_0_120,plain,
( cons(X1,app(X2,nil)) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_53])]) ).
cnf(c_0_121,negated_conjecture,
( sk3 = nil
| app(nil,sk4) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_89])]) ).
cnf(c_0_122,plain,
( cons(X1,app(X2,app(X3,nil))) != app(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_91]),c_0_53])]),c_0_54]) ).
cnf(c_0_123,negated_conjecture,
( app(nil,sk4) != nil
| ~ segmentP(sk4,nil) ),
inference(spm,[status(thm)],[c_0_78,c_0_121]) ).
cnf(c_0_124,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_125,plain,
( cons(X1,app(X2,nil)) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(app(X2,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_108]),c_0_53])]) ).
cnf(c_0_126,negated_conjecture,
app(nil,sk4) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_88]),c_0_89])]) ).
cnf(c_0_127,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_124]) ).
cnf(c_0_128,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_96])]) ).
cnf(c_0_129,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_130,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_10 ).
cnf(c_0_131,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_8 ).
cnf(c_0_132,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_125,c_0_102]) ).
cnf(c_0_133,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_108]),c_0_89])]) ).
cnf(c_0_134,plain,
( segmentP(app(X1,app(X2,X3)),X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_91]),c_0_103]) ).
cnf(c_0_135,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_128,c_0_71]) ).
cnf(c_0_136,negated_conjecture,
( sk5 = hd(sk3)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_53])]),c_0_131]) ).
cnf(c_0_137,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_96])]) ).
cnf(c_0_138,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_130,c_0_133]) ).
cnf(c_0_139,negated_conjecture,
( sk3 = nil
| segmentP(app(X1,cons(sk5,X2)),sk3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_69])]) ).
cnf(c_0_140,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_96])]) ).
cnf(c_0_141,negated_conjecture,
sk5 = hd(sk3),
inference(sr,[status(thm)],[c_0_136,c_0_133]) ).
cnf(c_0_142,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_82]),c_0_53])]) ).
cnf(c_0_143,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,hd(sk3))
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_48]),c_0_49])]),c_0_141]),c_0_142]) ).
cnf(c_0_144,negated_conjecture,
memberP(sk4,hd(sk3)),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_119,c_0_142]),c_0_141]) ).
cnf(c_0_145,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_89])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.71 % Problem : SWC374-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.71 % Command : run_E %s %d THM
% 0.11/0.92 % Computer : n015.cluster.edu
% 0.11/0.92 % Model : x86_64 x86_64
% 0.11/0.92 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.92 % Memory : 8042.1875MB
% 0.11/0.92 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.92 % CPULimit : 2400
% 0.11/0.92 % WCLimit : 300
% 0.11/0.92 % DateTime : Tue Oct 3 02:03:22 EDT 2023
% 0.11/0.92 % CPUTime :
% 0.17/1.04 Running first-order theorem proving
% 0.17/1.04 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rrIwLBAPu3/E---3.1_8118.p
% 1507.90/193.01 # Version: 3.1pre001
% 1507.90/193.01 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1507.90/193.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1507.90/193.01 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1507.90/193.01 # Starting new_bool_3 with 300s (1) cores
% 1507.90/193.01 # Starting new_bool_1 with 300s (1) cores
% 1507.90/193.01 # Starting sh5l with 300s (1) cores
% 1507.90/193.01 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8197 completed with status 0
% 1507.90/193.01 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1507.90/193.01 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1507.90/193.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1507.90/193.01 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1507.90/193.01 # No SInE strategy applied
% 1507.90/193.01 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1507.90/193.01 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1507.90/193.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1507.90/193.01 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1507.90/193.01 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1507.90/193.01 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1507.90/193.01 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1507.90/193.01 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 8205 completed with status 7
% 1507.90/193.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1507.90/193.01 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 8206 completed with status 7
% 1507.90/193.01 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1507.90/193.01 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 8207 completed with status 7
% 1507.90/193.01 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1507.90/193.01 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8204 completed with status 7
% 1507.90/193.01 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1507.90/193.01 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 8270 completed with status 0
% 1507.90/193.01 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 1507.90/193.01 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1507.90/193.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1507.90/193.01 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1507.90/193.01 # No SInE strategy applied
% 1507.90/193.01 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1507.90/193.01 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1507.90/193.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1507.90/193.01 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1507.90/193.01 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1507.90/193.01 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1507.90/193.01 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1507.90/193.01 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 8205 completed with status 7
% 1507.90/193.01 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1507.90/193.01 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 8206 completed with status 7
% 1507.90/193.01 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1507.90/193.01 # Preprocessing time : 0.003 s
% 1507.90/193.01 # Presaturation interreduction done
% 1507.90/193.01
% 1507.90/193.01 # Proof found!
% 1507.90/193.01 # SZS status Unsatisfiable
% 1507.90/193.01 # SZS output start CNFRefutation
% See solution above
% 1507.90/193.01 # Parsed axioms : 198
% 1507.90/193.01 # Removed by relevancy pruning/SinE : 0
% 1507.90/193.01 # Initial clauses : 198
% 1507.90/193.01 # Removed in clause preprocessing : 0
% 1507.90/193.01 # Initial clauses in saturation : 198
% 1507.90/193.01 # Processed clauses : 58338
% 1507.90/193.01 # ...of these trivial : 1041
% 1507.90/193.01 # ...subsumed : 49160
% 1507.90/193.01 # ...remaining for further processing : 8137
% 1507.90/193.01 # Other redundant clauses eliminated : 13194
% 1507.90/193.01 # Clauses deleted for lack of memory : 0
% 1507.90/193.01 # Backward-subsumed : 860
% 1507.90/193.01 # Backward-rewritten : 1244
% 1507.90/193.01 # Generated clauses : 1453542
% 1507.90/193.01 # ...of the previous two non-redundant : 1417907
% 1507.90/193.01 # ...aggressively subsumed : 0
% 1507.90/193.01 # Contextual simplify-reflections : 2036
% 1507.90/193.01 # Paramodulations : 1439597
% 1507.90/193.01 # Factorizations : 0
% 1507.90/193.01 # NegExts : 0
% 1507.90/193.01 # Equation resolutions : 13261
% 1507.90/193.01 # Total rewrite steps : 960709
% 1507.90/193.01 # Propositional unsat checks : 1
% 1507.90/193.01 # Propositional check models : 0
% 1507.90/193.01 # Propositional check unsatisfiable : 0
% 1507.90/193.01 # Propositional clauses : 0
% 1507.90/193.01 # Propositional clauses after purity: 0
% 1507.90/193.01 # Propositional unsat core size : 0
% 1507.90/193.01 # Propositional preprocessing time : 0.000
% 1507.90/193.01 # Propositional encoding time : 2.070
% 1507.90/193.01 # Propositional solver time : 0.879
% 1507.90/193.01 # Success case prop preproc time : 0.000
% 1507.90/193.01 # Success case prop encoding time : 0.000
% 1507.90/193.01 # Success case prop solver time : 0.000
% 1507.90/193.01 # Current number of processed clauses : 5135
% 1507.90/193.01 # Positive orientable unit clauses : 208
% 1507.90/193.01 # Positive unorientable unit clauses: 0
% 1507.90/193.01 # Negative unit clauses : 286
% 1507.90/193.01 # Non-unit-clauses : 4641
% 1507.90/193.01 # Current number of unprocessed clauses: 1350748
% 1507.90/193.01 # ...number of literals in the above : 11709041
% 1507.90/193.01 # Current number of archived formulas : 0
% 1507.90/193.01 # Current number of archived clauses : 2979
% 1507.90/193.01 # Clause-clause subsumption calls (NU) : 7145681
% 1507.90/193.01 # Rec. Clause-clause subsumption calls : 1576363
% 1507.90/193.01 # Non-unit clause-clause subsumptions : 36936
% 1507.90/193.01 # Unit Clause-clause subsumption calls : 239806
% 1507.90/193.01 # Rewrite failures with RHS unbound : 0
% 1507.90/193.01 # BW rewrite match attempts : 193
% 1507.90/193.01 # BW rewrite match successes : 87
% 1507.90/193.01 # Condensation attempts : 0
% 1507.90/193.01 # Condensation successes : 0
% 1507.90/193.01 # Termbank termtop insertions : 55758046
% 1507.90/193.01
% 1507.90/193.01 # -------------------------------------------------
% 1507.90/193.01 # User time : 603.305 s
% 1507.90/193.01 # System time : 9.097 s
% 1507.90/193.01 # Total time : 612.402 s
% 1507.90/193.01 # Maximum resident set size: 2120 pages
% 1507.90/193.01
% 1507.90/193.01 # -------------------------------------------------
% 1507.90/193.01 # User time : 922.948 s
% 1507.90/193.01 # System time : 14.811 s
% 1507.90/193.01 # Total time : 937.759 s
% 1507.90/193.01 # Maximum resident set size: 1852 pages
% 1507.90/193.01 % E---3.1 exiting
% 1507.90/193.01 % E---3.1 exiting
%------------------------------------------------------------------------------