TSTP Solution File: SWC345-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC345-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:32 EDT 2023
% Result : Unsatisfiable 882.35s 114.03s
% Output : CNFRefutation 882.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 47
% Syntax : Number of clauses : 159 ( 38 unt; 39 nHn; 137 RR)
% Number of literals : 420 ( 130 equ; 244 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-2 aty)
% Number of variables : 207 ( 34 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause171) ).
cnf(co1_12,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_6) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause13) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause96) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause97) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause104) ).
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/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause179) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause120) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause47) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause138) ).
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.VKflPlipDB/E---3.1_10840.p',clause149) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause74) ).
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.VKflPlipDB/E---3.1_10840.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause53) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause85) ).
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.VKflPlipDB/E---3.1_10840.p',clause157) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause116) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause72) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause86) ).
cnf(co1_15,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_15) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_5) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause3) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_2) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause56) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause118) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause168) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause73) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause49) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause145) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause140) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause48) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause71) ).
cnf(co1_13,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_13) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause99) ).
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.VKflPlipDB/E---3.1_10840.p',clause173) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',clause66) ).
cnf(co1_9,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_9) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_7) ).
cnf(co1_10,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p',co1_10) ).
cnf(c_0_47,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
clause171 ).
cnf(c_0_48,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_12 ).
cnf(c_0_49,axiom,
ssList(nil),
clause8 ).
cnf(c_0_50,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_51,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_52,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_53,negated_conjecture,
( sk3 = nil
| X1 = nil
| cons(X2,X1) != sk3
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),c_0_50]) ).
cnf(c_0_54,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_55,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_56,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_57,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( skaf82(sk3) = nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[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_56])])]),c_0_57])]) ).
cnf(c_0_59,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_60,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_61,negated_conjecture,
( cons(skaf83(sk3),nil) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_58]),c_0_57])]) ).
cnf(c_0_62,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_63,negated_conjecture,
( tl(sk3) = nil
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_48]),c_0_49])]),c_0_50]) ).
cnf(c_0_64,negated_conjecture,
( skaf83(sk3) = hd(sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_55]),c_0_49])]) ).
cnf(c_0_65,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_66,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_67,negated_conjecture,
( cons(hd(sk3),nil) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_57])]) ).
cnf(c_0_68,negated_conjecture,
( sk3 = nil
| ssItem(hd(sk3)) ),
inference(spm,[status(thm)],[c_0_55,c_0_64]) ).
cnf(c_0_69,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_65]) ).
cnf(c_0_70,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_71,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_72,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_73,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_75,negated_conjecture,
( cons(hd(sk3),skaf82(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_64]),c_0_57])]) ).
cnf(c_0_76,negated_conjecture,
( cons(hd(sk3),X1) = app(sk3,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_77,plain,
( ~ singletonP(X1)
| ~ ssList(app(app(X2,cons(skaf44(X1),X3)),X1))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X2,cons(skaf44(X1),X3)),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_49])]) ).
cnf(c_0_78,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_79,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_80,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_81,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_82,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_83,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_84,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_49])]) ).
cnf(c_0_85,negated_conjecture,
( app(sk3,skaf82(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_56])]) ).
cnf(c_0_86,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_87,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_88,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_89,plain,
( ~ memberP(X1,skaf44(X2))
| ~ singletonP(X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80]),c_0_71])]),c_0_81]) ).
cnf(c_0_90,plain,
( memberP(X1,skaf44(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_70]),c_0_71]),c_0_49])]) ).
cnf(c_0_91,negated_conjecture,
( cons(sk5,app(nil,X1)) = app(sk3,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_48]),c_0_49])]),c_0_50]) ).
cnf(c_0_92,negated_conjecture,
( app(nil,sk3) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_57]),c_0_56])]) ).
cnf(c_0_93,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_94,plain,
( ssItem(X1)
| duplicatefreeP(cons(X2,X3))
| ~ ssItem(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_95,plain,
( ~ singletonP(X1)
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_96,negated_conjecture,
( app(sk3,sk3) = cons(sk5,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_57])]) ).
cnf(c_0_97,negated_conjecture,
( sk3 = nil
| singletonP(sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_48]),c_0_57])]),c_0_50]) ).
cnf(c_0_98,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(X2,sk3))
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_57]) ).
cnf(c_0_99,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ strictorderedP(sk1) ),
co1_15 ).
cnf(c_0_100,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_101,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_95,c_0_96]),c_0_57])]),c_0_97]) ).
cnf(c_0_102,negated_conjecture,
( sk3 = nil
| ssItem(X1)
| duplicatefreeP(cons(sk5,sk3)) ),
inference(spm,[status(thm)],[c_0_98,c_0_50]) ).
cnf(c_0_103,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ strictorderedP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_52]),c_0_100]),c_0_52]) ).
cnf(c_0_104,negated_conjecture,
( sk3 = nil
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_106,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_107,negated_conjecture,
( ssItem(X1)
| ~ segmentP(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105])]) ).
cnf(c_0_108,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_109,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_106,c_0_100]) ).
cnf(c_0_110,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_111,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause168 ).
cnf(c_0_112,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_113,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_114,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_115,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_116,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109])]) ).
cnf(c_0_117,plain,
( app(X1,X2) = nil
| app(X1,app(X2,X3)) != nil
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_73]),c_0_81]) ).
cnf(c_0_118,plain,
( app(skaf47(X1,nil),skaf48(nil,X1)) = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_49]),c_0_113])]),c_0_108]) ).
cnf(c_0_119,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_120,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_121,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_73]),c_0_81]) ).
cnf(c_0_122,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_114])]),c_0_49])]) ).
cnf(c_0_123,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116])]) ).
cnf(c_0_124,plain,
( app(X1,skaf47(X2,nil)) = nil
| app(X1,X2) != nil
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_113])]) ).
cnf(c_0_125,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_116])]) ).
cnf(c_0_126,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_112,c_0_73]),c_0_49])]),c_0_81]) ).
cnf(c_0_127,plain,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_49])]) ).
cnf(c_0_128,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_123,c_0_124]),c_0_113])]),c_0_125]) ).
cnf(c_0_129,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_74,c_0_126]),c_0_49])]),c_0_127]) ).
cnf(c_0_130,plain,
( app(nil,X1) != nil
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_49])]) ).
cnf(c_0_131,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_13 ).
cnf(c_0_132,negated_conjecture,
( sk3 = nil
| app(nil,sk4) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_109])]) ).
cnf(c_0_133,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_134,plain,
( cons(X1,app(nil,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_83]),c_0_49])]) ).
cnf(c_0_135,negated_conjecture,
( sk3 = nil
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_74]),c_0_109])]) ).
cnf(c_0_136,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_137,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(app(nil,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_133,c_0_134]) ).
cnf(c_0_138,negated_conjecture,
( sk4 != nil
| ~ segmentP(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_135]),c_0_105])]) ).
cnf(c_0_139,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause66 ).
cnf(c_0_140,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_9 ).
cnf(c_0_141,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_142,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_136]) ).
cnf(c_0_143,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_81]),c_0_49])]) ).
cnf(c_0_144,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_108]),c_0_109])]) ).
cnf(c_0_145,negated_conjecture,
( sk4 = nil
| strictorderedP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141]) ).
cnf(c_0_146,plain,
( segmentP(app(X1,app(X2,X3)),X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_73]),c_0_121]) ).
cnf(c_0_147,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_48]),c_0_50]) ).
cnf(c_0_148,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_116])]) ).
cnf(c_0_149,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_140,c_0_144]) ).
cnf(c_0_150,negated_conjecture,
strictorderedP(sk3),
inference(sr,[status(thm)],[c_0_145,c_0_144]) ).
cnf(c_0_151,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_146,c_0_147]),c_0_57])]) ).
cnf(c_0_152,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_78,c_0_116])]) ).
cnf(c_0_153,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_122]),c_0_49])]) ).
cnf(c_0_154,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
co1_10 ).
cnf(c_0_155,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_150])]) ).
cnf(c_0_156,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_79]),c_0_80])]),c_0_153]) ).
cnf(c_0_157,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_154,c_0_144]) ).
cnf(c_0_158,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_157]),c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWC345-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 01:11:42 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.VKflPlipDB/E---3.1_10840.p
% 882.35/114.03 # Version: 3.1pre001
% 882.35/114.03 # Preprocessing class: FSLSSMSMSSSNFFN.
% 882.35/114.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 882.35/114.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 882.35/114.03 # Starting new_bool_3 with 300s (1) cores
% 882.35/114.03 # Starting new_bool_1 with 300s (1) cores
% 882.35/114.03 # Starting sh5l with 300s (1) cores
% 882.35/114.03 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10918 completed with status 0
% 882.35/114.03 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 882.35/114.03 # Preprocessing class: FSLSSMSMSSSNFFN.
% 882.35/114.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 882.35/114.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 882.35/114.03 # No SInE strategy applied
% 882.35/114.03 # Search class: FGHSM-FSLM21-MFFFFFNN
% 882.35/114.03 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 882.35/114.03 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 882.35/114.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 882.35/114.03 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 882.35/114.03 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 882.35/114.03 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 882.35/114.03 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10925 completed with status 0
% 882.35/114.03 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 882.35/114.03 # Preprocessing class: FSLSSMSMSSSNFFN.
% 882.35/114.03 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 882.35/114.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 882.35/114.03 # No SInE strategy applied
% 882.35/114.03 # Search class: FGHSM-FSLM21-MFFFFFNN
% 882.35/114.03 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 882.35/114.03 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 882.35/114.03 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 882.35/114.03 # Preprocessing time : 0.003 s
% 882.35/114.03 # Presaturation interreduction done
% 882.35/114.03
% 882.35/114.03 # Proof found!
% 882.35/114.03 # SZS status Unsatisfiable
% 882.35/114.03 # SZS output start CNFRefutation
% See solution above
% 882.35/114.03 # Parsed axioms : 200
% 882.35/114.03 # Removed by relevancy pruning/SinE : 0
% 882.35/114.03 # Initial clauses : 200
% 882.35/114.03 # Removed in clause preprocessing : 0
% 882.35/114.03 # Initial clauses in saturation : 200
% 882.35/114.03 # Processed clauses : 111096
% 882.35/114.03 # ...of these trivial : 1809
% 882.35/114.03 # ...subsumed : 95860
% 882.35/114.03 # ...remaining for further processing : 13427
% 882.35/114.03 # Other redundant clauses eliminated : 30122
% 882.35/114.03 # Clauses deleted for lack of memory : 423640
% 882.35/114.03 # Backward-subsumed : 1324
% 882.35/114.03 # Backward-rewritten : 1944
% 882.35/114.03 # Generated clauses : 2969027
% 882.35/114.03 # ...of the previous two non-redundant : 2849429
% 882.35/114.03 # ...aggressively subsumed : 0
% 882.35/114.03 # Contextual simplify-reflections : 4379
% 882.35/114.03 # Paramodulations : 2937959
% 882.35/114.03 # Factorizations : 2
% 882.35/114.03 # NegExts : 0
% 882.35/114.03 # Equation resolutions : 30215
% 882.35/114.03 # Total rewrite steps : 2221987
% 882.35/114.03 # Propositional unsat checks : 2
% 882.35/114.03 # Propositional check models : 0
% 882.35/114.03 # Propositional check unsatisfiable : 0
% 882.35/114.03 # Propositional clauses : 0
% 882.35/114.03 # Propositional clauses after purity: 0
% 882.35/114.03 # Propositional unsat core size : 0
% 882.35/114.03 # Propositional preprocessing time : 0.000
% 882.35/114.03 # Propositional encoding time : 3.646
% 882.35/114.03 # Propositional solver time : 1.262
% 882.35/114.03 # Success case prop preproc time : 0.000
% 882.35/114.03 # Success case prop encoding time : 0.000
% 882.35/114.03 # Success case prop solver time : 0.000
% 882.35/114.03 # Current number of processed clauses : 9092
% 882.35/114.03 # Positive orientable unit clauses : 292
% 882.35/114.03 # Positive unorientable unit clauses: 0
% 882.35/114.03 # Negative unit clauses : 356
% 882.35/114.03 # Non-unit-clauses : 8444
% 882.35/114.03 # Current number of unprocessed clauses: 1129419
% 882.35/114.03 # ...number of literals in the above : 9325467
% 882.35/114.03 # Current number of archived formulas : 0
% 882.35/114.03 # Current number of archived clauses : 4312
% 882.35/114.03 # Clause-clause subsumption calls (NU) : 24164323
% 882.35/114.03 # Rec. Clause-clause subsumption calls : 2396829
% 882.35/114.03 # Non-unit clause-clause subsumptions : 65054
% 882.35/114.03 # Unit Clause-clause subsumption calls : 384521
% 882.35/114.03 # Rewrite failures with RHS unbound : 0
% 882.35/114.03 # BW rewrite match attempts : 784
% 882.35/114.03 # BW rewrite match successes : 176
% 882.35/114.03 # Condensation attempts : 0
% 882.35/114.03 # Condensation successes : 0
% 882.35/114.03 # Termbank termtop insertions : 149305470
% 882.35/114.03
% 882.35/114.03 # -------------------------------------------------
% 882.35/114.03 # User time : 107.680 s
% 882.35/114.03 # System time : 1.591 s
% 882.35/114.03 # Total time : 109.271 s
% 882.35/114.03 # Maximum resident set size: 2140 pages
% 882.35/114.03
% 882.35/114.03 # -------------------------------------------------
% 882.35/114.03 # User time : 541.487 s
% 882.35/114.03 # System time : 8.369 s
% 882.35/114.03 # Total time : 549.855 s
% 882.35/114.03 # Maximum resident set size: 1852 pages
% 882.35/114.03 % E---3.1 exiting
% 882.35/114.03 % E---3.1 exiting
%------------------------------------------------------------------------------