TSTP Solution File: SWC410-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC410-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:53 EDT 2023
% Result : Unsatisfiable 3.75s 1.00s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 40
% Syntax : Number of clauses : 138 ( 37 unt; 32 nHn; 122 RR)
% Number of literals : 413 ( 119 equ; 262 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 185 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause76) ).
cnf(co1_12,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_12) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause116) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause133) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause85) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause118) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_6) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause96) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause73) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_5) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause98) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause120) ).
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.rELfDKhaCm/E---3.1_22804.p',clause179) ).
cnf(co1_8,negated_conjecture,
memberP(sk2,sk5),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_8) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause72) ).
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.rELfDKhaCm/E---3.1_22804.p',clause169) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_7) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause53) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause97) ).
cnf(clause139,axiom,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause139) ).
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.rELfDKhaCm/E---3.1_22804.p',clause170) ).
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.rELfDKhaCm/E---3.1_22804.p',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause71) ).
cnf(clause158,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause158) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk1,sk5),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_9) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause138) ).
cnf(clause117,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',clause117) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.rELfDKhaCm/E---3.1_22804.p',co1_11) ).
cnf(c_0_40,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_41,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_42,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_43,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_44,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
co1_12 ).
cnf(c_0_45,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_46,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_47,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_48,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_49,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_50,negated_conjecture,
( sk4 = X1
| tl(sk3) != X2
| hd(sk3) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk3)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_52,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_53,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_54,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_55,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_56,axiom,
ssList(nil),
clause8 ).
cnf(c_0_57,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_58,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_59,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_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_60,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_61,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| ~ neq(nil,sk3)
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_50])])])]),c_0_48]) ).
cnf(c_0_62,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_63,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_64,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_65,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_66,plain,
( tl(X1) = nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
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])]) ).
cnf(c_0_67,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_56])]) ).
cnf(c_0_68,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_59,c_0_60]),c_0_56])]),c_0_42]) ).
cnf(c_0_69,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_70,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_56]),c_0_63])]) ).
cnf(c_0_71,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_10 ).
cnf(c_0_73,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_74,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_68,c_0_53]),c_0_58]),c_0_69]) ).
cnf(c_0_75,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_76,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_62]),c_0_71]),c_0_56])]),c_0_72]) ).
cnf(c_0_77,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_78,negated_conjecture,
memberP(sk2,sk5),
co1_8 ).
cnf(c_0_79,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_58]),c_0_56])]) ).
cnf(c_0_80,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_56])]) ).
cnf(c_0_81,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_43]),c_0_63])]) ).
cnf(c_0_82,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_77]) ).
cnf(c_0_83,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_84,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_85,negated_conjecture,
memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_78,c_0_65]) ).
cnf(c_0_86,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_87,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_79]),c_0_80]) ).
cnf(c_0_88,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_42]),c_0_63])]) ).
cnf(c_0_89,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_90,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_71])]) ).
cnf(c_0_91,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_92,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_93,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_58]),c_0_56])]) ).
cnf(c_0_94,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_58]),c_0_56])]) ).
cnf(c_0_95,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_86]),c_0_91]),c_0_92])]) ).
cnf(c_0_96,plain,
( ssList(cons(X1,nil))
| ~ ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_93]),c_0_56])]) ).
cnf(c_0_97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_98,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_41,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_99,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_43]),c_0_63])]) ).
cnf(c_0_100,axiom,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
clause139 ).
cnf(c_0_101,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_48]),c_0_71])]) ).
cnf(c_0_102,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_56])]) ).
cnf(c_0_103,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_63])]) ).
cnf(c_0_104,negated_conjecture,
( memberP(cons(X1,sk4),sk5)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_85]),c_0_86]),c_0_71])]) ).
cnf(c_0_105,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_56]),c_0_86])]) ).
cnf(c_0_106,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_58]),c_0_56])]) ).
cnf(c_0_107,axiom,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
clause170 ).
cnf(c_0_108,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_109,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_110,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
clause158 ).
cnf(c_0_111,negated_conjecture,
memberP(cons(X1,sk4),sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_112,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_43]),c_0_63])]) ).
cnf(c_0_113,negated_conjecture,
~ memberP(sk1,sk5),
co1_9 ).
cnf(c_0_114,plain,
( skaf44(cons(X1,X2)) = X1
| ~ singletonP(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
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_107,c_0_54]),c_0_55]),c_0_56])])]),c_0_58]) ).
cnf(c_0_115,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_116,plain,
( skaf44(X1) = X2
| ~ memberP(X1,X2)
| ~ singletonP(X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_54]),c_0_55]),c_0_56])]),c_0_109]) ).
cnf(c_0_117,plain,
( memberP(X1,X2)
| memberP(X3,X2)
| ~ memberP(app(X1,X3),X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_105])]) ).
cnf(c_0_118,negated_conjecture,
( sk3 = nil
| memberP(app(sk3,cons(hd(sk3),nil)),sk5) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_119,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_105])]) ).
cnf(c_0_120,negated_conjecture,
~ memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_113,c_0_52]) ).
cnf(c_0_121,plain,
( skaf44(cons(X1,nil)) = X1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_67]),c_0_56])]) ).
cnf(c_0_122,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_115]) ).
cnf(c_0_123,plain,
( skaf44(X1) = X2
| ~ memberP(X1,X2)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_105])]) ).
cnf(c_0_124,negated_conjecture,
( sk3 = nil
| memberP(cons(hd(sk3),nil),sk5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_63])]),c_0_120]) ).
cnf(c_0_125,plain,
skaf44(cons(X1,nil)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_105])]) ).
cnf(c_0_126,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_105])]) ).
cnf(c_0_127,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause117 ).
cnf(c_0_128,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_129,plain,
( nil = X1
| memberP(X1,hd(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_130,negated_conjecture,
( hd(sk3) = sk5
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_126]),c_0_119])]) ).
cnf(c_0_131,plain,
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_127]) ).
cnf(c_0_132,negated_conjecture,
( sk4 = nil
| neq(sk3,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_62]),c_0_71]),c_0_56])]) ).
cnf(c_0_133,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_63])]),c_0_120]) ).
cnf(c_0_134,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_105])]) ).
cnf(c_0_135,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_133]),c_0_134]) ).
cnf(c_0_136,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_105])]) ).
cnf(c_0_137,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_135]),c_0_136]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWC410-1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n007.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Oct 3 01:29:25 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.rELfDKhaCm/E---3.1_22804.p
% 3.75/1.00 # Version: 3.1pre001
% 3.75/1.00 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.75/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.75/1.00 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.75/1.00 # Starting new_bool_3 with 300s (1) cores
% 3.75/1.00 # Starting new_bool_1 with 300s (1) cores
% 3.75/1.00 # Starting sh5l with 300s (1) cores
% 3.75/1.00 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22933 completed with status 0
% 3.75/1.00 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.75/1.00 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.75/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.75/1.00 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.75/1.00 # No SInE strategy applied
% 3.75/1.00 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.75/1.00 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.75/1.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.75/1.00 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.75/1.00 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.75/1.00 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.75/1.00 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 3.75/1.00 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 22942 completed with status 0
% 3.75/1.00 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 3.75/1.00 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.75/1.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.75/1.00 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.75/1.00 # No SInE strategy applied
% 3.75/1.00 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.75/1.00 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.75/1.00 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.75/1.00 # Preprocessing time : 0.005 s
% 3.75/1.00 # Presaturation interreduction done
% 3.75/1.00
% 3.75/1.00 # Proof found!
% 3.75/1.00 # SZS status Unsatisfiable
% 3.75/1.00 # SZS output start CNFRefutation
% See solution above
% 3.75/1.00 # Parsed axioms : 197
% 3.75/1.00 # Removed by relevancy pruning/SinE : 0
% 3.75/1.00 # Initial clauses : 197
% 3.75/1.00 # Removed in clause preprocessing : 0
% 3.75/1.00 # Initial clauses in saturation : 197
% 3.75/1.00 # Processed clauses : 4212
% 3.75/1.00 # ...of these trivial : 28
% 3.75/1.00 # ...subsumed : 2676
% 3.75/1.00 # ...remaining for further processing : 1508
% 3.75/1.00 # Other redundant clauses eliminated : 268
% 3.75/1.00 # Clauses deleted for lack of memory : 0
% 3.75/1.00 # Backward-subsumed : 274
% 3.75/1.00 # Backward-rewritten : 599
% 3.75/1.00 # Generated clauses : 19421
% 3.75/1.00 # ...of the previous two non-redundant : 18336
% 3.75/1.00 # ...aggressively subsumed : 0
% 3.75/1.00 # Contextual simplify-reflections : 386
% 3.75/1.00 # Paramodulations : 19146
% 3.75/1.00 # Factorizations : 0
% 3.75/1.00 # NegExts : 0
% 3.75/1.00 # Equation resolutions : 279
% 3.75/1.00 # Total rewrite steps : 14453
% 3.75/1.00 # Propositional unsat checks : 0
% 3.75/1.00 # Propositional check models : 0
% 3.75/1.00 # Propositional check unsatisfiable : 0
% 3.75/1.00 # Propositional clauses : 0
% 3.75/1.00 # Propositional clauses after purity: 0
% 3.75/1.00 # Propositional unsat core size : 0
% 3.75/1.00 # Propositional preprocessing time : 0.000
% 3.75/1.00 # Propositional encoding time : 0.000
% 3.75/1.00 # Propositional solver time : 0.000
% 3.75/1.00 # Success case prop preproc time : 0.000
% 3.75/1.00 # Success case prop encoding time : 0.000
% 3.75/1.00 # Success case prop solver time : 0.000
% 3.75/1.00 # Current number of processed clauses : 422
% 3.75/1.00 # Positive orientable unit clauses : 66
% 3.75/1.00 # Positive unorientable unit clauses: 0
% 3.75/1.00 # Negative unit clauses : 12
% 3.75/1.00 # Non-unit-clauses : 344
% 3.75/1.00 # Current number of unprocessed clauses: 14290
% 3.75/1.00 # ...number of literals in the above : 83496
% 3.75/1.00 # Current number of archived formulas : 0
% 3.75/1.00 # Current number of archived clauses : 1062
% 3.75/1.00 # Clause-clause subsumption calls (NU) : 169759
% 3.75/1.00 # Rec. Clause-clause subsumption calls : 58521
% 3.75/1.00 # Non-unit clause-clause subsumptions : 2960
% 3.75/1.00 # Unit Clause-clause subsumption calls : 1911
% 3.75/1.00 # Rewrite failures with RHS unbound : 0
% 3.75/1.00 # BW rewrite match attempts : 49
% 3.75/1.00 # BW rewrite match successes : 39
% 3.75/1.00 # Condensation attempts : 0
% 3.75/1.00 # Condensation successes : 0
% 3.75/1.00 # Termbank termtop insertions : 378379
% 3.75/1.00
% 3.75/1.00 # -------------------------------------------------
% 3.75/1.00 # User time : 0.450 s
% 3.75/1.00 # System time : 0.014 s
% 3.75/1.00 # Total time : 0.464 s
% 3.75/1.00 # Maximum resident set size: 2140 pages
% 3.75/1.00
% 3.75/1.00 # -------------------------------------------------
% 3.75/1.00 # User time : 2.167 s
% 3.75/1.00 # System time : 0.099 s
% 3.75/1.00 # Total time : 2.266 s
% 3.75/1.00 # Maximum resident set size: 1852 pages
% 3.75/1.00 % E---3.1 exiting
% 3.75/1.01 % E---3.1 exiting
%------------------------------------------------------------------------------