TSTP Solution File: SWC180-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC180-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:39:44 EDT 2023
% Result : Unsatisfiable 670.11s 85.13s
% Output : CNFRefutation 670.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 43
% Syntax : Number of clauses : 140 ( 31 unt; 14 nHn; 113 RR)
% Number of literals : 407 ( 85 equ; 273 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 3 con; 0-2 aty)
% Number of variables : 237 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause73) ).
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.SjtP4xSNbP/E---3.1_1635.p',clause149) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause85) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause99) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause120) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause143) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause132) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause60) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause74) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause47) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause131) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause150) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause51) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause58) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause50) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause123) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause76) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause104) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause96) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause86) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause98) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause138) ).
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.SjtP4xSNbP/E---3.1_1635.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.SjtP4xSNbP/E---3.1_1635.p',clause169) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause145) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause72) ).
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.SjtP4xSNbP/E---3.1_1635.p',clause157) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause116) ).
cnf(co1_8,negated_conjecture,
( lt(X4,X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssItem(X4)
| ~ memberP(X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',co1_6) ).
cnf(clause162,axiom,
( duplicatefreeP(X1)
| app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause162) ).
cnf(clause21,axiom,
ssItem(skaf74(X1)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause21) ).
cnf(clause18,axiom,
ssList(skaf77(X1)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause18) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',co1_1) ).
cnf(co1_9,negated_conjecture,
~ duplicatefreeP(sk1),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',co1_9) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause141) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause63) ).
cnf(clause20,axiom,
ssList(skaf75(X1)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause20) ).
cnf(clause19,axiom,
ssList(skaf76(X1)),
file('/export/starexec/sandbox/tmp/tmp.SjtP4xSNbP/E---3.1_1635.p',clause19) ).
cnf(c_0_43,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_44,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_47,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_48,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_49,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_50,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_51,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_52,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_53,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_43,c_0_44]),c_0_45])]),c_0_46]) ).
cnf(c_0_54,plain,
( app(cons(X1,nil),X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_56,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_57,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_58,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_46]) ).
cnf(c_0_59,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_60,plain,
( app(nil,skaf45(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_45])]) ).
cnf(c_0_61,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_62,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
clause58 ).
cnf(c_0_63,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_45])]) ).
cnf(c_0_64,plain,
( app(X1,X2) != X2
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_65,plain,
( app(skaf46(app(X1,X2),X2),X2) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_46]) ).
cnf(c_0_66,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_67,plain,
( skaf45(app(nil,X1),nil) = X1
| ~ ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_45])])]) ).
cnf(c_0_68,plain,
( app(skaf46(X1,nil),nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_62]),c_0_45])]) ).
cnf(c_0_69,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_46]),c_0_45])]) ).
cnf(c_0_70,plain,
( app(X1,X2) != X2
| ~ singletonP(skaf46(app(X1,X2),X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_71,plain,
( skaf45(X1,nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_60]),c_0_61])]) ).
cnf(c_0_72,plain,
( skaf45(app(nil,X1),nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_46]),c_0_45])]) ).
cnf(c_0_73,plain,
( app(nil,skaf46(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_66])]) ).
cnf(c_0_74,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_75,plain,
( ~ singletonP(skaf46(X1,skaf45(X1,nil)))
| ~ ssList(X1) ),
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_60]),c_0_61]),c_0_45])]),c_0_71]) ).
cnf(c_0_76,plain,
( skaf45(X1,nil) = skaf46(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_66])]) ).
cnf(c_0_77,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_78,plain,
( hd(skaf46(X1,nil)) = hd(X1)
| skaf46(X1,nil) = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_68]),c_0_66]),c_0_45])]) ).
cnf(c_0_79,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_80,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_81,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_82,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_83,plain,
( ~ singletonP(skaf46(X1,skaf46(X1,nil)))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,plain,
( skaf46(X1,nil) = nil
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_66])]) ).
cnf(c_0_85,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_86,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_87,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_79,c_0_80]),c_0_81]),c_0_82]) ).
cnf(c_0_88,plain,
( ssItem(hd(X1))
| ~ singletonP(skaf46(X1,nil))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_89,plain,
( skaf46(X1,nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_68]),c_0_66])]) ).
cnf(c_0_90,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_91,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_92,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_86]) ).
cnf(c_0_93,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_55]),c_0_56]),c_0_45])]) ).
cnf(c_0_94,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,plain,
( app(skaf42(cons(X1,X2),X1),cons(X1,skaf43(X1,cons(X1,X2)))) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_81]) ).
cnf(c_0_96,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_97,plain,
( ~ singletonP(X1)
| ~ ssList(app(app(X2,cons(hd(X1),X3)),X1))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X2,cons(hd(X1),X3)),X1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_45])]),c_0_94]) ).
cnf(c_0_98,plain,
( app(skaf42(X1,hd(X1)),cons(hd(X1),skaf43(hd(X1),X1))) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_93]),c_0_45])]),c_0_94]) ).
cnf(c_0_99,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_100,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_101,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_102,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_103,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_96])]),c_0_45])]) ).
cnf(c_0_104,plain,
( ~ singletonP(X1)
| ~ ssList(app(X1,X1))
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),c_0_100])]) ).
cnf(c_0_105,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_101,c_0_46]) ).
cnf(c_0_106,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_107,negated_conjecture,
( lt(X4,X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssItem(X4)
| ~ memberP(X2,X4) ),
co1_8 ).
cnf(c_0_108,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_109,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_48]) ).
cnf(c_0_110,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_45])]) ).
cnf(c_0_111,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(app(X2,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_112,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_106]) ).
cnf(c_0_113,negated_conjecture,
( lt(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != sk1
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_114,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_45])]) ).
cnf(c_0_115,axiom,
( duplicatefreeP(X1)
| app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
| ~ ssList(X1) ),
clause162 ).
cnf(c_0_116,axiom,
ssItem(skaf74(X1)),
clause21 ).
cnf(c_0_117,axiom,
ssList(skaf77(X1)),
clause18 ).
cnf(c_0_118,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_111,c_0_46]) ).
cnf(c_0_119,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_81]),c_0_45])]) ).
cnf(c_0_120,negated_conjecture,
( lt(X1,X2)
| app(X3,app(cons(X2,nil),X4)) != sk1
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_44]),c_0_114]) ).
cnf(c_0_121,plain,
( app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),app(cons(skaf74(X1),nil),skaf77(X1))) = X1
| duplicatefreeP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_48]),c_0_116]),c_0_117])]) ).
cnf(c_0_122,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_123,negated_conjecture,
~ duplicatefreeP(sk1),
co1_9 ).
cnf(c_0_124,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_114]) ).
cnf(c_0_125,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_126,negated_conjecture,
( lt(X1,skaf74(sk1))
| ~ memberP(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),X1)
| ~ ssItem(X1)
| ~ ssList(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1)))) ),
inference(sr,[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_120,c_0_121]),c_0_116]),c_0_117])])]),c_0_122])]),c_0_123]) ).
cnf(c_0_127,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_124,c_0_56]) ).
cnf(c_0_128,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_91]),c_0_81]) ).
cnf(c_0_129,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
clause63 ).
cnf(c_0_130,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_46]) ).
cnf(c_0_131,negated_conjecture,
( lt(X1,skaf74(sk1))
| ~ memberP(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1))),X1)
| ~ ssList(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127])]) ).
cnf(c_0_132,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_127])]) ).
cnf(c_0_133,axiom,
ssList(skaf75(X1)),
clause20 ).
cnf(c_0_134,axiom,
ssList(skaf76(X1)),
clause19 ).
cnf(c_0_135,plain,
~ lt(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_127])]) ).
cnf(c_0_136,plain,
( ssList(app(X1,cons(X2,X3)))
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_48]),c_0_114]) ).
cnf(c_0_137,negated_conjecture,
~ ssList(app(skaf75(sk1),cons(skaf74(sk1),skaf76(sk1)))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]),c_0_134])]),c_0_135]) ).
cnf(c_0_138,plain,
( ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_136,c_0_127])]) ).
cnf(c_0_139,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_134]),c_0_133])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC180-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n007.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:54:09 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/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.SjtP4xSNbP/E---3.1_1635.p
% 670.11/85.13 # Version: 3.1pre001
% 670.11/85.13 # Preprocessing class: FSLSSMSSSSSNFFN.
% 670.11/85.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 670.11/85.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 670.11/85.13 # Starting new_bool_3 with 300s (1) cores
% 670.11/85.13 # Starting new_bool_1 with 300s (1) cores
% 670.11/85.13 # Starting sh5l with 300s (1) cores
% 670.11/85.13 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1716 completed with status 0
% 670.11/85.13 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 670.11/85.13 # Preprocessing class: FSLSSMSSSSSNFFN.
% 670.11/85.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 670.11/85.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 670.11/85.13 # No SInE strategy applied
% 670.11/85.13 # Search class: FGHSM-FSLM21-MFFFFFNN
% 670.11/85.13 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 670.11/85.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 670.11/85.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 670.11/85.13 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 670.11/85.13 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 670.11/85.13 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 670.11/85.13 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1724 completed with status 0
% 670.11/85.13 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 670.11/85.13 # Preprocessing class: FSLSSMSSSSSNFFN.
% 670.11/85.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 670.11/85.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 670.11/85.13 # No SInE strategy applied
% 670.11/85.13 # Search class: FGHSM-FSLM21-MFFFFFNN
% 670.11/85.13 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 670.11/85.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 670.11/85.13 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 670.11/85.13 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 670.11/85.13 # Preprocessing time : 0.003 s
% 670.11/85.13
% 670.11/85.13 # Proof found!
% 670.11/85.13 # SZS status Unsatisfiable
% 670.11/85.13 # SZS output start CNFRefutation
% See solution above
% 670.11/85.13 # Parsed axioms : 194
% 670.11/85.13 # Removed by relevancy pruning/SinE : 0
% 670.11/85.13 # Initial clauses : 194
% 670.11/85.13 # Removed in clause preprocessing : 0
% 670.11/85.13 # Initial clauses in saturation : 194
% 670.11/85.13 # Processed clauses : 84983
% 670.11/85.13 # ...of these trivial : 252
% 670.11/85.13 # ...subsumed : 74646
% 670.11/85.13 # ...remaining for further processing : 10085
% 670.11/85.13 # Other redundant clauses eliminated : 24689
% 670.11/85.13 # Clauses deleted for lack of memory : 5292
% 670.11/85.13 # Backward-subsumed : 267
% 670.11/85.13 # Backward-rewritten : 3243
% 670.11/85.13 # Generated clauses : 2471322
% 670.11/85.13 # ...of the previous two non-redundant : 2399869
% 670.11/85.13 # ...aggressively subsumed : 0
% 670.11/85.13 # Contextual simplify-reflections : 3622
% 670.11/85.13 # Paramodulations : 2446487
% 670.11/85.13 # Factorizations : 8
% 670.11/85.13 # NegExts : 0
% 670.11/85.13 # Equation resolutions : 24828
% 670.11/85.13 # Total rewrite steps : 1665508
% 670.11/85.13 # Propositional unsat checks : 0
% 670.11/85.13 # Propositional check models : 0
% 670.11/85.13 # Propositional check unsatisfiable : 0
% 670.11/85.13 # Propositional clauses : 0
% 670.11/85.13 # Propositional clauses after purity: 0
% 670.11/85.13 # Propositional unsat core size : 0
% 670.11/85.13 # Propositional preprocessing time : 0.000
% 670.11/85.13 # Propositional encoding time : 0.000
% 670.11/85.13 # Propositional solver time : 0.000
% 670.11/85.13 # Success case prop preproc time : 0.000
% 670.11/85.13 # Success case prop encoding time : 0.000
% 670.11/85.13 # Success case prop solver time : 0.000
% 670.11/85.13 # Current number of processed clauses : 6552
% 670.11/85.13 # Positive orientable unit clauses : 84
% 670.11/85.13 # Positive unorientable unit clauses: 0
% 670.11/85.13 # Negative unit clauses : 59
% 670.11/85.13 # Non-unit-clauses : 6409
% 670.11/85.13 # Current number of unprocessed clauses: 1417814
% 670.11/85.13 # ...number of literals in the above : 9192602
% 670.11/85.13 # Current number of archived formulas : 0
% 670.11/85.13 # Current number of archived clauses : 3510
% 670.11/85.13 # Clause-clause subsumption calls (NU) : 28260965
% 670.11/85.13 # Rec. Clause-clause subsumption calls : 2495504
% 670.11/85.13 # Non-unit clause-clause subsumptions : 45405
% 670.11/85.13 # Unit Clause-clause subsumption calls : 42064
% 670.11/85.13 # Rewrite failures with RHS unbound : 0
% 670.11/85.13 # BW rewrite match attempts : 143
% 670.11/85.13 # BW rewrite match successes : 90
% 670.11/85.13 # Condensation attempts : 0
% 670.11/85.13 # Condensation successes : 0
% 670.11/85.13 # Termbank termtop insertions : 71206826
% 670.11/85.13
% 670.11/85.13 # -------------------------------------------------
% 670.11/85.13 # User time : 81.819 s
% 670.11/85.13 # System time : 1.682 s
% 670.11/85.13 # Total time : 83.500 s
% 670.11/85.13 # Maximum resident set size: 2108 pages
% 670.11/85.13
% 670.11/85.13 # -------------------------------------------------
% 670.11/85.13 # User time : 410.917 s
% 670.11/85.13 # System time : 8.606 s
% 670.11/85.13 # Total time : 419.523 s
% 670.11/85.13 # Maximum resident set size: 1848 pages
% 670.11/85.13 % E---3.1 exiting
% 670.11/85.13 % E---3.1 exiting
%------------------------------------------------------------------------------