TSTP Solution File: SWC368-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC368-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:39 EDT 2023
% Result : Unsatisfiable 1577.11s 198.93s
% Output : CNFRefutation 1577.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 37
% Syntax : Number of formulae : 136 ( 40 unt; 0 def)
% Number of atoms : 366 ( 115 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 439 ( 209 ~; 228 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 172 ( 16 sgn; 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause138) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause161) ).
cnf(co1_13,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_13) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause8) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_9) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause71) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause13) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_6) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause96) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause172) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause74) ).
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.mzFM539OEZ/E---3.1_31131.p',clause157) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause73) ).
cnf(co1_7,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_5) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause79) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_2) ).
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.mzFM539OEZ/E---3.1_31131.p',clause149) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause145) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause120) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause85) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause97) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause104) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause118) ).
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.mzFM539OEZ/E---3.1_31131.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.mzFM539OEZ/E---3.1_31131.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',clause72) ).
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.mzFM539OEZ/E---3.1_31131.p',clause173) ).
cnf(co1_14,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.mzFM539OEZ/E---3.1_31131.p',co1_14) ).
cnf(c_0_35,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_36,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_37,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_13 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_9 ).
cnf(c_0_40,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_41,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_42,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_43,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_44,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_45,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_46,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_47,negated_conjecture,
( sk3 = nil
| sk5 = X1
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),c_0_40]) ).
cnf(c_0_48,plain,
( nil = X1
| memberP(X1,skaf83(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( skaf83(sk3) = sk5
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_43]),c_0_49])]) ).
cnf(c_0_51,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_52,negated_conjecture,
( cons(sk5,skaf82(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_50]),c_0_49])]) ).
cnf(c_0_53,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_54,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_55,negated_conjecture,
( skaf82(sk3) = tl(sk3)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_44])]),c_0_39]) ).
cnf(c_0_56,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_38])]) ).
cnf(c_0_57,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_58,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_59,negated_conjecture,
( cons(skaf83(sk3),tl(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_55]),c_0_49])]) ).
cnf(c_0_60,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_51,c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_61,negated_conjecture,
~ segmentP(sk2,sk1),
co1_7 ).
cnf(c_0_62,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_63,plain,
( segmentP(X1,X2)
| ~ segmentP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_54]),c_0_38])]) ).
cnf(c_0_64,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_65,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_66,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_67,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_38])]) ).
cnf(c_0_68,negated_conjecture,
( cons(skaf83(sk3),nil) = sk3
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_46]) ).
cnf(c_0_70,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_65,c_0_62]) ).
cnf(c_0_72,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_66,c_0_54]),c_0_38])]) ).
cnf(c_0_73,negated_conjecture,
( app(sk3,nil) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_43]),c_0_38])]) ).
cnf(c_0_74,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_75,negated_conjecture,
sk3 != nil,
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_76,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_72,c_0_73]),c_0_49]),c_0_38])]) ).
cnf(c_0_77,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_78,plain,
( app(cons(X1,X2),X3) = cons(X1,nil)
| nil != X3
| nil != X2
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_74]) ).
cnf(c_0_79,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_37,c_0_75]) ).
cnf(c_0_80,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_39,c_0_75]) ).
cnf(c_0_81,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_82,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_83,negated_conjecture,
app(nil,sk3) = sk3,
inference(sr,[status(thm)],[c_0_76,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_37]),c_0_39]) ).
cnf(c_0_85,negated_conjecture,
( app(sk3,X1) = sk3
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_79]),c_0_80]),c_0_38])]) ).
cnf(c_0_86,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_66]),c_0_81]) ).
cnf(c_0_87,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_88,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_89,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_90,plain,
( hd(app(cons(X1,X2),X3)) = X1
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_57]),c_0_81]) ).
cnf(c_0_91,negated_conjecture,
( app(cons(X1,nil),sk3) = cons(X1,sk3)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_83]),c_0_49]),c_0_38])]) ).
cnf(c_0_92,negated_conjecture,
( cons(sk5,X1) = sk3
| nil != X1
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_75]) ).
cnf(c_0_93,negated_conjecture,
( sk3 = nil
| ssList(app(X1,sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_73]),c_0_38]),c_0_49])]) ).
cnf(c_0_94,plain,
( cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_81]),c_0_89]) ).
cnf(c_0_95,negated_conjecture,
( hd(app(sk3,X1)) = sk5
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_79]),c_0_80]),c_0_38])]) ).
cnf(c_0_96,negated_conjecture,
tl(sk3) = nil,
inference(sr,[status(thm)],[c_0_60,c_0_75]) ).
cnf(c_0_97,negated_conjecture,
app(sk3,sk3) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_80]),c_0_38])]) ).
cnf(c_0_98,negated_conjecture,
( sk3 = nil
| ssList(cons(sk5,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_84]),c_0_49])]) ).
cnf(c_0_99,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_100,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_101,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_102,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_103,negated_conjecture,
( cons(sk5,app(nil,X1)) = app(sk3,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_94,c_0_95]),c_0_96]),c_0_49])]),c_0_75]) ).
cnf(c_0_104,negated_conjecture,
app(nil,cons(sk5,sk3)) = cons(sk5,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_97]),c_0_49])]) ).
cnf(c_0_105,negated_conjecture,
ssList(cons(sk5,sk3)),
inference(sr,[status(thm)],[c_0_98,c_0_75]) ).
cnf(c_0_106,negated_conjecture,
( sk3 = nil
| memberP(sk3,sk5) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37]),c_0_38])]),c_0_39]) ).
cnf(c_0_107,plain,
( app(X1,cons(X2,X3)) != X4
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ duplicatefreeP(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]),c_0_102])]) ).
cnf(c_0_108,negated_conjecture,
app(sk3,cons(sk5,sk3)) = cons(sk5,cons(sk5,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105])]) ).
cnf(c_0_109,negated_conjecture,
memberP(sk3,sk5),
inference(sr,[status(thm)],[c_0_106,c_0_75]) ).
fof(c_0_110,plain,
( ~ epred2_0
<=> ! [X1] :
( duplicatefreeP(X1)
| ~ ssList(X1) ) ),
introduced(definition) ).
cnf(c_0_111,negated_conjecture,
( cons(sk5,cons(sk5,sk3)) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_80]),c_0_49])]) ).
cnf(c_0_112,plain,
( epred2_0
| duplicatefreeP(X1)
| ~ ssList(X1) ),
inference(split_equiv,[status(thm)],[c_0_110]) ).
cnf(c_0_113,negated_conjecture,
( ssList(app(X1,cons(sk5,sk3)))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_97]),c_0_49])]) ).
cnf(c_0_114,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_79]),c_0_80])]) ).
fof(c_0_115,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_116,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_117,negated_conjecture,
( epred2_0
| cons(sk5,cons(sk5,sk3)) != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_118,negated_conjecture,
ssList(cons(sk5,cons(sk5,sk3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_49]),c_0_105])]) ).
cnf(c_0_119,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_116,c_0_115]),c_0_110]) ).
cnf(c_0_120,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_117]),c_0_118])]) ).
cnf(c_0_121,plain,
( epred1_0
| ssItem(X1) ),
inference(split_equiv,[status(thm)],[c_0_115]) ).
cnf(c_0_122,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_120])]) ).
cnf(c_0_123,plain,
( segmentP(app(X1,app(X2,X3)),X4)
| ~ segmentP(X2,X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_66]) ).
cnf(c_0_124,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_126,negated_conjecture,
( segmentP(app(X1,cons(sk5,X2)),X3)
| ~ segmentP(sk3,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_114]),c_0_49])]) ).
cnf(c_0_127,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_100,c_0_124])]) ).
cnf(c_0_128,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_54]),c_0_38])]) ).
cnf(c_0_129,negated_conjecture,
app(sk3,nil) = sk3,
inference(sr,[status(thm)],[c_0_73,c_0_75]) ).
cnf(c_0_130,negated_conjecture,
( segmentP(X1,X2)
| ~ memberP(X1,sk5)
| ~ segmentP(sk3,X2)
| ~ ssList(X2)
| ~ 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_102]),c_0_101])]) ).
cnf(c_0_131,negated_conjecture,
( segmentP(X1,sk3)
| sk3 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_38]),c_0_49])]) ).
cnf(c_0_132,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_14 ).
cnf(c_0_133,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_49])]) ).
cnf(c_0_134,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_132,c_0_75]) ).
cnf(c_0_135,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_133]),c_0_134]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC368-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:40:01 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.mzFM539OEZ/E---3.1_31131.p
% 1577.11/198.93 # Version: 3.1pre001
% 1577.11/198.93 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1577.11/198.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1577.11/198.93 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1577.11/198.93 # Starting new_bool_3 with 300s (1) cores
% 1577.11/198.93 # Starting new_bool_1 with 300s (1) cores
% 1577.11/198.93 # Starting sh5l with 300s (1) cores
% 1577.11/198.93 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31209 completed with status 0
% 1577.11/198.93 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1577.11/198.93 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1577.11/198.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1577.11/198.93 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1577.11/198.93 # No SInE strategy applied
% 1577.11/198.93 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1577.11/198.93 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1577.11/198.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1577.11/198.93 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1577.11/198.93 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1577.11/198.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1577.11/198.93 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1577.11/198.93 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 31219 completed with status 7
% 1577.11/198.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1577.11/198.93 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 31218 completed with status 7
% 1577.11/198.93 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1577.11/198.93 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 31217 completed with status 7
% 1577.11/198.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1577.11/198.93 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31216 completed with status 7
% 1577.11/198.93 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1577.11/198.93 # G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 31237 completed with status 0
% 1577.11/198.93 # Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1577.11/198.93 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1577.11/198.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1577.11/198.93 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1577.11/198.93 # No SInE strategy applied
% 1577.11/198.93 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1577.11/198.93 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1577.11/198.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1577.11/198.93 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1577.11/198.93 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1577.11/198.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1577.11/198.93 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1577.11/198.93 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 31219 completed with status 7
% 1577.11/198.93 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1577.11/198.93 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 31218 completed with status 7
% 1577.11/198.93 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1577.11/198.93 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 31217 completed with status 7
% 1577.11/198.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1577.11/198.93 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31216 completed with status 7
% 1577.11/198.93 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1577.11/198.93 # Preprocessing time : 0.003 s
% 1577.11/198.93 # Presaturation interreduction done
% 1577.11/198.93
% 1577.11/198.93 # Proof found!
% 1577.11/198.93 # SZS status Unsatisfiable
% 1577.11/198.93 # SZS output start CNFRefutation
% See solution above
% 1577.11/198.93 # Parsed axioms : 200
% 1577.11/198.93 # Removed by relevancy pruning/SinE : 0
% 1577.11/198.93 # Initial clauses : 200
% 1577.11/198.93 # Removed in clause preprocessing : 0
% 1577.11/198.93 # Initial clauses in saturation : 200
% 1577.11/198.93 # Processed clauses : 47842
% 1577.11/198.93 # ...of these trivial : 1239
% 1577.11/198.93 # ...subsumed : 38132
% 1577.11/198.93 # ...remaining for further processing : 8471
% 1577.11/198.93 # Other redundant clauses eliminated : 16246
% 1577.11/198.93 # Clauses deleted for lack of memory : 0
% 1577.11/198.93 # Backward-subsumed : 1097
% 1577.11/198.93 # Backward-rewritten : 1614
% 1577.11/198.93 # Generated clauses : 1435002
% 1577.11/198.93 # ...of the previous two non-redundant : 1366605
% 1577.11/198.93 # ...aggressively subsumed : 0
% 1577.11/198.93 # Contextual simplify-reflections : 2406
% 1577.11/198.93 # Paramodulations : 1417616
% 1577.11/198.93 # Factorizations : 0
% 1577.11/198.93 # NegExts : 0
% 1577.11/198.93 # Equation resolutions : 17102
% 1577.11/198.93 # Total rewrite steps : 943598
% 1577.11/198.93 # Propositional unsat checks : 0
% 1577.11/198.93 # Propositional check models : 0
% 1577.11/198.93 # Propositional check unsatisfiable : 0
% 1577.11/198.93 # Propositional clauses : 0
% 1577.11/198.93 # Propositional clauses after purity: 0
% 1577.11/198.93 # Propositional unsat core size : 0
% 1577.11/198.93 # Propositional preprocessing time : 0.000
% 1577.11/198.93 # Propositional encoding time : 0.000
% 1577.11/198.93 # Propositional solver time : 0.000
% 1577.11/198.93 # Success case prop preproc time : 0.000
% 1577.11/198.93 # Success case prop encoding time : 0.000
% 1577.11/198.93 # Success case prop solver time : 0.000
% 1577.11/198.93 # Current number of processed clauses : 5388
% 1577.11/198.93 # Positive orientable unit clauses : 249
% 1577.11/198.93 # Positive unorientable unit clauses: 0
% 1577.11/198.93 # Negative unit clauses : 237
% 1577.11/198.93 # Non-unit-clauses : 4902
% 1577.11/198.93 # Current number of unprocessed clauses: 1306686
% 1577.11/198.93 # ...number of literals in the above : 11790161
% 1577.11/198.93 # Current number of archived formulas : 0
% 1577.11/198.93 # Current number of archived clauses : 2971
% 1577.11/198.93 # Clause-clause subsumption calls (NU) : 9069476
% 1577.11/198.93 # Rec. Clause-clause subsumption calls : 817569
% 1577.11/198.93 # Non-unit clause-clause subsumptions : 24450
% 1577.11/198.93 # Unit Clause-clause subsumption calls : 365267
% 1577.11/198.93 # Rewrite failures with RHS unbound : 0
% 1577.11/198.93 # BW rewrite match attempts : 703
% 1577.11/198.93 # BW rewrite match successes : 296
% 1577.11/198.93 # Condensation attempts : 0
% 1577.11/198.93 # Condensation successes : 0
% 1577.11/198.93 # Termbank termtop insertions : 39786969
% 1577.11/198.93
% 1577.11/198.93 # -------------------------------------------------
% 1577.11/198.93 # User time : 597.224 s
% 1577.11/198.93 # System time : 8.997 s
% 1577.11/198.93 # Total time : 606.221 s
% 1577.11/198.93 # Maximum resident set size: 2132 pages
% 1577.11/198.93
% 1577.11/198.93 # -------------------------------------------------
% 1577.11/198.93 # User time : 973.616 s
% 1577.11/198.93 # System time : 15.833 s
% 1577.11/198.93 # Total time : 989.449 s
% 1577.11/198.93 # Maximum resident set size: 1852 pages
% 1577.11/198.93 % E---3.1 exiting
% 1577.11/198.93 % E---3.1 exiting
%------------------------------------------------------------------------------