TSTP Solution File: SWC079-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC079-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:22 EDT 2023
% Result : Unsatisfiable 1.93s 0.73s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 40
% Syntax : Number of clauses : 137 ( 26 unt; 45 nHn; 129 RR)
% Number of literals : 391 ( 145 equ; 221 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 156 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_5) ).
cnf(co1_12,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_2) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause8) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause76) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause133) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause85) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause118) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause73) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause96) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause98) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause116) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause120) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause47) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause97) ).
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.MWradTDBsa/E---3.1_18382.p',clause149) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause144) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause171) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_1) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause13) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause123) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause132) ).
cnf(clause170,axiom,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause170) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause51) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',co1_11) ).
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.MWradTDBsa/E---3.1_18382.p',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause74) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause57) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause79) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p',clause56) ).
cnf(c_0_40,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_41,negated_conjecture,
neq(sk2,nil),
c_0_40 ).
cnf(c_0_42,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_43,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_44,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_45,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_47,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_45])])])]) ).
cnf(c_0_48,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_49,axiom,
ssList(nil),
clause8 ).
cnf(c_0_50,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_51,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_52,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_53,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_54,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_55,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),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_49]),c_0_50])]) ).
cnf(c_0_56,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_54]) ).
cnf(c_0_57,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_58,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_59,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_60,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_54]),c_0_50])]) ).
cnf(c_0_61,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_62,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_56,c_0_57]),c_0_58]),c_0_59]) ).
cnf(c_0_63,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_64,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_49])]) ).
cnf(c_0_65,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_62,c_0_63]),c_0_49])]),c_0_53]) ).
cnf(c_0_66,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_67,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_68,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_69,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_70,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_54]),c_0_50])]) ).
cnf(c_0_71,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_65,c_0_66]),c_0_61]),c_0_67]) ).
cnf(c_0_72,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_73,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_74,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_75,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_77,plain,
( app(X1,nil) != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_49])]) ).
cnf(c_0_78,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_79,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_61]),c_0_49])]) ).
cnf(c_0_80,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_54]),c_0_50])]) ).
cnf(c_0_81,negated_conjecture,
( hd(sk1) = hd(sk4)
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_70]),c_0_49])]) ).
cnf(c_0_82,plain,
( app(X1,app(X2,nil)) != nil
| ~ singletonP(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_77,c_0_78]),c_0_49])]),c_0_58]) ).
cnf(c_0_83,negated_conjecture,
( sk4 = nil
| singletonP(sk1)
| ~ ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_79,c_0_70]) ).
cnf(c_0_84,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_85,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_80]),c_0_50])]) ).
cnf(c_0_86,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
clause171 ).
cnf(c_0_87,negated_conjecture,
( hd(sk1) = hd(sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_54]),c_0_50])]) ).
cnf(c_0_88,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_89,plain,
( app(X1,X2) != nil
| ~ singletonP(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_63]) ).
cnf(c_0_90,negated_conjecture,
( app(sk1,nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_80]),c_0_49])]) ).
cnf(c_0_91,negated_conjecture,
( sk4 = nil
| singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_54]),c_0_50])]) ).
cnf(c_0_92,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_84]),c_0_58]) ).
cnf(c_0_93,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_53]),c_0_50])]) ).
cnf(c_0_94,negated_conjecture,
( sk4 = nil
| X1 = nil
| cons(X2,X1) != sk1
| ~ ssItem(hd(sk4))
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_70]),c_0_49])]) ).
cnf(c_0_95,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_96,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_97,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_98,negated_conjecture,
( sk4 = nil
| sk1 = nil
| ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_87]),c_0_88])]) ).
cnf(c_0_99,negated_conjecture,
( sk4 = nil
| sk1 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_88]),c_0_49])]),c_0_91]) ).
cnf(c_0_100,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk1)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_88])]) ).
cnf(c_0_101,negated_conjecture,
( skaf82(sk1) = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[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_94,c_0_95]),c_0_96]),c_0_97])])]),c_0_88])]),c_0_98]),c_0_99]) ).
cnf(c_0_102,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_103,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_104,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_53]),c_0_50])]) ).
cnf(c_0_105,negated_conjecture,
( cons(skaf83(sk1),nil) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_101]),c_0_88])]),c_0_99]) ).
cnf(c_0_106,axiom,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
clause170 ).
cnf(c_0_107,plain,
( cons(hd(X1),tl(app(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_52,c_0_102]),c_0_58]),c_0_59]) ).
cnf(c_0_108,negated_conjecture,
( app(sk1,skaf45(sk4,sk1)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_88]),c_0_50])]) ).
cnf(c_0_109,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_110,negated_conjecture,
( skaf83(sk1) = hd(sk1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_105]),c_0_96]),c_0_49])]) ).
cnf(c_0_111,plain,
( skaf83(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_95]),c_0_96]),c_0_97])])]),c_0_61]),c_0_67]) ).
cnf(c_0_112,negated_conjecture,
( cons(hd(sk1),tl(sk4)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_88]),c_0_109])]),c_0_99]) ).
cnf(c_0_113,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk1)) ),
inference(spm,[status(thm)],[c_0_96,c_0_110]) ).
cnf(c_0_114,negated_conjecture,
( skaf83(sk4) = hd(sk1)
| sk4 = nil
| ~ ssList(tl(sk4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]) ).
cnf(c_0_115,negated_conjecture,
( skaf83(sk4) = hd(sk1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_53]),c_0_50])]) ).
cnf(c_0_116,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_117,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_118,plain,
( cons(hd(cons(X1,X2)),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_66]),c_0_61]),c_0_67]) ).
cnf(c_0_119,negated_conjecture,
( cons(hd(sk1),skaf82(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_115]),c_0_50])]) ).
cnf(c_0_120,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_42]),c_0_45])]) ).
cnf(c_0_121,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_117]) ).
cnf(c_0_122,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_123,negated_conjecture,
( cons(hd(sk4),skaf82(sk4)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_97])]),c_0_113]) ).
cnf(c_0_124,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_48]),c_0_49])]) ).
cnf(c_0_125,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_126,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_49])]),c_0_58]) ).
cnf(c_0_127,negated_conjecture,
( app(sk1,skaf82(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_123]),c_0_97])]) ).
cnf(c_0_128,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_88])]) ).
cnf(c_0_129,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_97]),c_0_88])]) ).
cnf(c_0_130,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_131,negated_conjecture,
( ~ segmentP(sk1,sk4)
| ~ segmentP(sk4,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_45]),c_0_50])]) ).
cnf(c_0_132,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_99]) ).
cnf(c_0_133,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_130]),c_0_49])]) ).
cnf(c_0_134,negated_conjecture,
~ segmentP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_132]),c_0_132]),c_0_132]),c_0_133])]) ).
cnf(c_0_135,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_136,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC079-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:26:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.MWradTDBsa/E---3.1_18382.p
% 1.93/0.73 # Version: 3.1pre001
% 1.93/0.73 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.93/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.93/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.93/0.73 # Starting new_bool_1 with 300s (1) cores
% 1.93/0.73 # Starting sh5l with 300s (1) cores
% 1.93/0.73 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18459 completed with status 0
% 1.93/0.73 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.93/0.73 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.93/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.93/0.73 # No SInE strategy applied
% 1.93/0.73 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.93/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.93/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.93/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.93/0.73 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.93/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.93/0.73 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 18465 completed with status 0
% 1.93/0.73 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.93/0.73 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.93/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/0.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.93/0.73 # No SInE strategy applied
% 1.93/0.73 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.93/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.93/0.73 # Preprocessing time : 0.003 s
% 1.93/0.73 # Presaturation interreduction done
% 1.93/0.73
% 1.93/0.73 # Proof found!
% 1.93/0.73 # SZS status Unsatisfiable
% 1.93/0.73 # SZS output start CNFRefutation
% See solution above
% 1.93/0.73 # Parsed axioms : 197
% 1.93/0.73 # Removed by relevancy pruning/SinE : 0
% 1.93/0.73 # Initial clauses : 197
% 1.93/0.73 # Removed in clause preprocessing : 0
% 1.93/0.73 # Initial clauses in saturation : 197
% 1.93/0.73 # Processed clauses : 2629
% 1.93/0.73 # ...of these trivial : 7
% 1.93/0.73 # ...subsumed : 1643
% 1.93/0.73 # ...remaining for further processing : 979
% 1.93/0.73 # Other redundant clauses eliminated : 169
% 1.93/0.73 # Clauses deleted for lack of memory : 0
% 1.93/0.73 # Backward-subsumed : 91
% 1.93/0.73 # Backward-rewritten : 276
% 1.93/0.73 # Generated clauses : 9477
% 1.93/0.73 # ...of the previous two non-redundant : 8821
% 1.93/0.73 # ...aggressively subsumed : 0
% 1.93/0.73 # Contextual simplify-reflections : 227
% 1.93/0.73 # Paramodulations : 9300
% 1.93/0.73 # Factorizations : 0
% 1.93/0.73 # NegExts : 0
% 1.93/0.73 # Equation resolutions : 179
% 1.93/0.73 # Total rewrite steps : 8606
% 1.93/0.73 # Propositional unsat checks : 0
% 1.93/0.73 # Propositional check models : 0
% 1.93/0.73 # Propositional check unsatisfiable : 0
% 1.93/0.73 # Propositional clauses : 0
% 1.93/0.73 # Propositional clauses after purity: 0
% 1.93/0.73 # Propositional unsat core size : 0
% 1.93/0.73 # Propositional preprocessing time : 0.000
% 1.93/0.73 # Propositional encoding time : 0.000
% 1.93/0.73 # Propositional solver time : 0.000
% 1.93/0.73 # Success case prop preproc time : 0.000
% 1.93/0.73 # Success case prop encoding time : 0.000
% 1.93/0.73 # Success case prop solver time : 0.000
% 1.93/0.73 # Current number of processed clauses : 402
% 1.93/0.73 # Positive orientable unit clauses : 61
% 1.93/0.73 # Positive unorientable unit clauses: 0
% 1.93/0.73 # Negative unit clauses : 3
% 1.93/0.73 # Non-unit-clauses : 338
% 1.93/0.73 # Current number of unprocessed clauses: 6498
% 1.93/0.73 # ...number of literals in the above : 36705
% 1.93/0.73 # Current number of archived formulas : 0
% 1.93/0.73 # Current number of archived clauses : 553
% 1.93/0.73 # Clause-clause subsumption calls (NU) : 72390
% 1.93/0.73 # Rec. Clause-clause subsumption calls : 24268
% 1.93/0.73 # Non-unit clause-clause subsumptions : 1775
% 1.93/0.73 # Unit Clause-clause subsumption calls : 169
% 1.93/0.73 # Rewrite failures with RHS unbound : 0
% 1.93/0.73 # BW rewrite match attempts : 3
% 1.93/0.73 # BW rewrite match successes : 3
% 1.93/0.73 # Condensation attempts : 0
% 1.93/0.73 # Condensation successes : 0
% 1.93/0.73 # Termbank termtop insertions : 175484
% 1.93/0.73
% 1.93/0.73 # -------------------------------------------------
% 1.93/0.73 # User time : 0.224 s
% 1.93/0.73 # System time : 0.009 s
% 1.93/0.73 # Total time : 0.233 s
% 1.93/0.73 # Maximum resident set size: 2148 pages
% 1.93/0.73
% 1.93/0.73 # -------------------------------------------------
% 1.93/0.73 # User time : 1.084 s
% 1.93/0.73 # System time : 0.060 s
% 1.93/0.73 # Total time : 1.144 s
% 1.93/0.73 # Maximum resident set size: 1852 pages
% 1.93/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------