TSTP Solution File: SWC228-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC228-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:41:31 EDT 2024
% Result : Unsatisfiable 7.09s 1.40s
% Output : CNFRefutation 7.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 50
% Syntax : Number of clauses : 212 ( 66 unt; 19 nHn; 193 RR)
% Number of literals : 593 ( 156 equ; 379 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-3 aty)
% Number of variables : 314 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause123) ).
cnf(co1_14,negated_conjecture,
app(sk3,sk6) = sk4,
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_7) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause118) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause104) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_1) ).
cnf(co1_13,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_13) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_5) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause76) ).
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.ABLW0vHOju/E---3.1_5197.p',clause171) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause13) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause75) ).
cnf(clause176,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause176) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause85) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause96) ).
cnf(clause174,axiom,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause174) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause61) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause150) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause73) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause132) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause8) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause143) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause51) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause136) ).
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.ABLW0vHOju/E---3.1_5197.p',clause149) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause120) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause86) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause131) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause58) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause137) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause60) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause50) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause145) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.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.ABLW0vHOju/E---3.1_5197.p',clause179) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause74) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause169) ).
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.ABLW0vHOju/E---3.1_5197.p',clause157) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause72) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',co1_9) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause71) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause116) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ABLW0vHOju/E---3.1_5197.p',clause101) ).
cnf(c_0_50,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_51,negated_conjecture,
app(sk3,sk6) = sk4,
co1_14 ).
cnf(c_0_52,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_53,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_54,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_55,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_56,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
app(sk1,sk6) = sk4,
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_59,negated_conjecture,
ssList(sk6),
co1_13 ).
cnf(c_0_60,negated_conjecture,
nil != sk1,
c_0_53 ).
cnf(c_0_61,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_62,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_63,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_64,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_65,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_66,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_67,negated_conjecture,
hd(sk4) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]),c_0_60]) ).
cnf(c_0_68,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_57]),c_0_59]),c_0_58])]),c_0_60]) ).
cnf(c_0_70,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_64 ).
cnf(c_0_71,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_65 ).
cnf(c_0_72,negated_conjecture,
cons(hd(sk1),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),c_0_69]) ).
cnf(c_0_73,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_67]),c_0_68])]),c_0_69]) ).
cnf(c_0_74,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_75,negated_conjecture,
( tl(sk4) = X1
| cons(X2,X1) != sk4
| ~ ssItem(X2)
| ~ ssList(tl(sk4))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_76,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_74 ).
cnf(c_0_77,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_78,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_79,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_80,negated_conjecture,
( skaf82(sk4) = tl(sk4)
| ~ ssList(tl(sk4)) ),
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_75,c_0_76]),c_0_77]),c_0_78])])]),c_0_68])]),c_0_69]) ).
cnf(c_0_81,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_79 ).
cnf(c_0_82,plain,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause176]) ).
cnf(c_0_83,negated_conjecture,
skaf82(sk4) = tl(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_68])]),c_0_69]) ).
cnf(c_0_84,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_85,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_86,plain,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
c_0_82 ).
cnf(c_0_87,negated_conjecture,
ssList(tl(sk4)),
inference(spm,[status(thm)],[c_0_78,c_0_83]) ).
cnf(c_0_88,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_84 ).
cnf(c_0_89,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_85 ).
cnf(c_0_90,negated_conjecture,
( hd(sk1) = X1
| ~ frontsegP(sk4,cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_72]),c_0_73]),c_0_87])]) ).
cnf(c_0_91,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_88]),c_0_89]) ).
cnf(c_0_92,negated_conjecture,
( skaf83(X1) = hd(sk1)
| nil = X1
| ~ frontsegP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_76]),c_0_77]),c_0_78])]) ).
cnf(c_0_93,negated_conjecture,
frontsegP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_57]),c_0_59]),c_0_58])]) ).
cnf(c_0_94,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_95,negated_conjecture,
skaf83(sk1) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_58])]),c_0_60]) ).
cnf(c_0_96,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_94 ).
cnf(c_0_97,negated_conjecture,
cons(hd(sk1),skaf82(sk1)) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_95]),c_0_58])]),c_0_60]) ).
cnf(c_0_98,plain,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause174]) ).
cnf(c_0_99,negated_conjecture,
skaf82(sk1) = tl(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_73]),c_0_78])]) ).
cnf(c_0_100,plain,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
c_0_98 ).
cnf(c_0_101,negated_conjecture,
cons(hd(sk1),tl(sk1)) = sk1,
inference(rw,[status(thm)],[c_0_97,c_0_99]) ).
cnf(c_0_102,negated_conjecture,
ssList(tl(sk1)),
inference(spm,[status(thm)],[c_0_78,c_0_99]) ).
cnf(c_0_103,negated_conjecture,
( frontsegP(X1,tl(sk1))
| ~ frontsegP(cons(X2,X1),sk1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_73]),c_0_102])]) ).
cnf(c_0_104,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_105,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_106,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_107,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_108,negated_conjecture,
( frontsegP(tl(sk1),tl(sk1))
| ~ frontsegP(sk1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_101]),c_0_73]),c_0_102])]) ).
cnf(c_0_109,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
c_0_104 ).
cnf(c_0_110,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_105 ).
cnf(c_0_111,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_106 ).
cnf(c_0_112,axiom,
ssList(nil),
clause8 ).
cnf(c_0_113,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_107 ).
cnf(c_0_114,negated_conjecture,
frontsegP(tl(sk1),tl(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_58])]) ).
cnf(c_0_115,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_116,plain,
( X1 = nil
| app(X2,X1) != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112])]) ).
cnf(c_0_117,negated_conjecture,
app(tl(sk1),skaf45(tl(sk1),tl(sk1))) = tl(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_102])]) ).
cnf(c_0_118,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_119,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_115 ).
cnf(c_0_120,negated_conjecture,
skaf45(tl(sk1),tl(sk1)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_102])]) ).
cnf(c_0_121,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_122,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_119]),c_0_89]) ).
cnf(c_0_123,negated_conjecture,
app(tl(sk1),nil) = tl(sk1),
inference(rw,[status(thm)],[c_0_117,c_0_120]) ).
cnf(c_0_124,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_125,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_121 ).
cnf(c_0_126,negated_conjecture,
rearsegP(tl(sk1),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_112]),c_0_102])]) ).
cnf(c_0_127,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_128,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_124 ).
cnf(c_0_129,negated_conjecture,
( rearsegP(app(X1,tl(sk1)),nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_112]),c_0_102])]) ).
cnf(c_0_130,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_127 ).
cnf(c_0_131,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_132,negated_conjecture,
( X1 = sk6
| app(sk1,X1) != sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_57]),c_0_59]),c_0_58])]) ).
cnf(c_0_133,negated_conjecture,
( app(sk1,app(sk6,X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_134,negated_conjecture,
( rearsegP(cons(X1,tl(sk1)),nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_102])]) ).
cnf(c_0_135,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_131 ).
cnf(c_0_136,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_137,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_138,negated_conjecture,
( app(sk6,X1) = sk6
| app(sk4,X1) != sk4
| ~ ssList(app(sk6,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_139,negated_conjecture,
( rearsegP(cons(X1,tl(sk1)),nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_112])]) ).
cnf(c_0_140,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_136 ).
cnf(c_0_141,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_137 ).
cnf(c_0_142,negated_conjecture,
( app(sk6,nil) = sk6
| ~ ssList(app(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_111]),c_0_112]),c_0_68])]) ).
cnf(c_0_143,plain,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause137]) ).
cnf(c_0_144,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_145,negated_conjecture,
rearsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_101]),c_0_73])]) ).
cnf(c_0_146,plain,
( app(skaf46(X1,nil),nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_112])]) ).
cnf(c_0_147,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_148,negated_conjecture,
app(sk6,nil) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_89]),c_0_59]),c_0_112])]) ).
cnf(c_0_149,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_150,plain,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_143 ).
cnf(c_0_151,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_144 ).
cnf(c_0_152,negated_conjecture,
app(skaf46(sk1,nil),nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_145]),c_0_112]),c_0_58])]) ).
cnf(c_0_153,plain,
( skaf46(X1,nil) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_146]),c_0_147])]) ).
cnf(c_0_154,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_155,negated_conjecture,
( app(sk6,app(nil,X1)) = app(sk6,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_148]),c_0_59]),c_0_112])]) ).
cnf(c_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_149 ).
cnf(c_0_157,plain,
( frontsegP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_112])]) ).
cnf(c_0_158,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_58])]) ).
cnf(c_0_159,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_154 ).
cnf(c_0_160,negated_conjecture,
( app(sk4,app(nil,X1)) = app(sk1,app(sk6,X1))
| ~ ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_133,c_0_155]) ).
cnf(c_0_161,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_156])]),c_0_112])]) ).
cnf(c_0_162,negated_conjecture,
frontsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_112]),c_0_58])]) ).
cnf(c_0_163,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_164,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_159]) ).
cnf(c_0_165,negated_conjecture,
( app(sk4,app(nil,X1)) = app(sk1,app(sk6,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_89]),c_0_112])]) ).
cnf(c_0_166,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_167,plain,
( app(nil,app(nil,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_161]),c_0_112])]) ).
cnf(c_0_168,negated_conjecture,
app(nil,skaf45(sk1,nil)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_162]),c_0_112]),c_0_58])]) ).
cnf(c_0_169,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_163 ).
cnf(c_0_170,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_171,negated_conjecture,
( memberP(sk4,hd(sk1))
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_72]),c_0_73])]) ).
cnf(c_0_172,negated_conjecture,
( ssList(app(sk1,app(sk6,X1)))
| ~ ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_165]),c_0_68])]) ).
cnf(c_0_173,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_166 ).
cnf(c_0_174,negated_conjecture,
app(nil,sk1) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_118])]) ).
cnf(c_0_175,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_176,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_169]) ).
cnf(c_0_177,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_170 ).
cnf(c_0_178,negated_conjecture,
memberP(sk4,hd(sk1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_81]),c_0_68])]),c_0_69]) ).
cnf(c_0_179,negated_conjecture,
( ssList(app(sk1,app(sk6,X1)))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_180,negated_conjecture,
app(sk1,app(sk6,sk1)) = app(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_174]),c_0_58])]) ).
cnf(c_0_181,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_175 ).
cnf(c_0_182,negated_conjecture,
( ~ ssList(app(app(X1,cons(hd(sk1),X2)),sk1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(hd(sk1),X2)),sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_101]),c_0_73]),c_0_102])]) ).
cnf(c_0_183,negated_conjecture,
app(skaf42(sk4,hd(sk1)),cons(hd(sk1),skaf43(hd(sk1),sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_73]),c_0_68])]) ).
cnf(c_0_184,negated_conjecture,
ssList(app(sk4,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_58])]) ).
cnf(c_0_185,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_186,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_187,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_188,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_189,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_181]),c_0_135]) ).
cnf(c_0_190,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_191,negated_conjecture,
~ duplicatefreeP(app(sk4,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_183]),c_0_184]),c_0_185]),c_0_186])]) ).
cnf(c_0_192,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_187 ).
cnf(c_0_193,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_194,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_188 ).
cnf(c_0_195,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_161]),c_0_112])]) ).
cnf(c_0_196,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_190 ).
cnf(c_0_197,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_184])]) ).
cnf(c_0_198,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_193 ).
cnf(c_0_199,negated_conjecture,
( memberP(nil,sk5(X1,nil,X2))
| app(cons(X2,nil),X1) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_173]),c_0_112])]),c_0_195]) ).
cnf(c_0_200,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_196,c_0_197])]) ).
cnf(c_0_201,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_202,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_198]) ).
cnf(c_0_203,negated_conjecture,
( app(cons(X1,nil),X2) != sk1
| ~ ssList(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_197])]),c_0_200]) ).
cnf(c_0_204,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_201 ).
cnf(c_0_205,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_135]),c_0_112])]) ).
cnf(c_0_206,negated_conjecture,
( app(X1,X2) != sk1
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_203,c_0_204]) ).
cnf(c_0_207,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_197])]) ).
cnf(c_0_208,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_197])]) ).
cnf(c_0_209,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_197])]) ).
cnf(c_0_210,negated_conjecture,
( cons(X1,X2) != sk1
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_206,c_0_207]),c_0_208]),c_0_209])]) ).
cnf(c_0_211,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_101]),c_0_102])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC228-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 15:44:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.ABLW0vHOju/E---3.1_5197.p
% 7.09/1.40 # Version: 3.1.0
% 7.09/1.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 7.09/1.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.09/1.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.09/1.40 # Starting new_bool_3 with 300s (1) cores
% 7.09/1.40 # Starting new_bool_1 with 300s (1) cores
% 7.09/1.40 # Starting sh5l with 300s (1) cores
% 7.09/1.40 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 5286 completed with status 0
% 7.09/1.40 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.09/1.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 7.09/1.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.09/1.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.09/1.40 # No SInE strategy applied
% 7.09/1.40 # Search class: FGHSM-FSLM31-MFFFFFNN
% 7.09/1.40 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.09/1.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 7.09/1.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.09/1.40 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 7.09/1.40 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.09/1.40 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 7.09/1.40 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 5292 completed with status 0
% 7.09/1.40 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 7.09/1.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 7.09/1.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.09/1.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.09/1.40 # No SInE strategy applied
% 7.09/1.40 # Search class: FGHSM-FSLM31-MFFFFFNN
% 7.09/1.40 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.09/1.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 7.09/1.40 # Preprocessing time : 0.003 s
% 7.09/1.40 # Presaturation interreduction done
% 7.09/1.40
% 7.09/1.40 # Proof found!
% 7.09/1.40 # SZS status Unsatisfiable
% 7.09/1.40 # SZS output start CNFRefutation
% See solution above
% 7.09/1.40 # Parsed axioms : 202
% 7.09/1.40 # Removed by relevancy pruning/SinE : 0
% 7.09/1.40 # Initial clauses : 202
% 7.09/1.40 # Removed in clause preprocessing : 0
% 7.09/1.40 # Initial clauses in saturation : 202
% 7.09/1.40 # Processed clauses : 8371
% 7.09/1.40 # ...of these trivial : 324
% 7.09/1.40 # ...subsumed : 4651
% 7.09/1.40 # ...remaining for further processing : 3396
% 7.09/1.40 # Other redundant clauses eliminated : 399
% 7.09/1.40 # Clauses deleted for lack of memory : 0
% 7.09/1.40 # Backward-subsumed : 177
% 7.09/1.40 # Backward-rewritten : 594
% 7.09/1.40 # Generated clauses : 42626
% 7.09/1.40 # ...of the previous two non-redundant : 38899
% 7.09/1.40 # ...aggressively subsumed : 0
% 7.09/1.40 # Contextual simplify-reflections : 343
% 7.09/1.40 # Paramodulations : 42212
% 7.09/1.40 # Factorizations : 0
% 7.09/1.40 # NegExts : 0
% 7.09/1.40 # Equation resolutions : 413
% 7.09/1.40 # Disequality decompositions : 0
% 7.09/1.40 # Total rewrite steps : 53715
% 7.09/1.40 # ...of those cached : 52751
% 7.09/1.40 # Propositional unsat checks : 0
% 7.09/1.40 # Propositional check models : 0
% 7.09/1.40 # Propositional check unsatisfiable : 0
% 7.09/1.40 # Propositional clauses : 0
% 7.09/1.40 # Propositional clauses after purity: 0
% 7.09/1.40 # Propositional unsat core size : 0
% 7.09/1.40 # Propositional preprocessing time : 0.000
% 7.09/1.40 # Propositional encoding time : 0.000
% 7.09/1.40 # Propositional solver time : 0.000
% 7.09/1.40 # Success case prop preproc time : 0.000
% 7.09/1.40 # Success case prop encoding time : 0.000
% 7.09/1.40 # Success case prop solver time : 0.000
% 7.09/1.40 # Current number of processed clauses : 2406
% 7.09/1.40 # Positive orientable unit clauses : 530
% 7.09/1.40 # Positive unorientable unit clauses: 0
% 7.09/1.40 # Negative unit clauses : 424
% 7.09/1.40 # Non-unit-clauses : 1452
% 7.09/1.40 # Current number of unprocessed clauses: 30387
% 7.09/1.40 # ...number of literals in the above : 134102
% 7.09/1.40 # Current number of archived formulas : 0
% 7.09/1.40 # Current number of archived clauses : 966
% 7.09/1.40 # Clause-clause subsumption calls (NU) : 326634
% 7.09/1.40 # Rec. Clause-clause subsumption calls : 128712
% 7.09/1.40 # Non-unit clause-clause subsumptions : 2563
% 7.09/1.40 # Unit Clause-clause subsumption calls : 68457
% 7.09/1.40 # Rewrite failures with RHS unbound : 0
% 7.09/1.40 # BW rewrite match attempts : 858
% 7.09/1.40 # BW rewrite match successes : 168
% 7.09/1.40 # Condensation attempts : 0
% 7.09/1.40 # Condensation successes : 0
% 7.09/1.40 # Termbank termtop insertions : 872696
% 7.09/1.40 # Search garbage collected termcells : 567
% 7.09/1.40
% 7.09/1.40 # -------------------------------------------------
% 7.09/1.40 # User time : 0.828 s
% 7.09/1.40 # System time : 0.025 s
% 7.09/1.40 # Total time : 0.853 s
% 7.09/1.40 # Maximum resident set size: 2136 pages
% 7.09/1.40
% 7.09/1.40 # -------------------------------------------------
% 7.09/1.40 # User time : 4.196 s
% 7.09/1.40 # System time : 0.155 s
% 7.09/1.40 # Total time : 4.351 s
% 7.09/1.40 # Maximum resident set size: 1868 pages
% 7.09/1.40 % E---3.1 exiting
%------------------------------------------------------------------------------