TSTP Solution File: SWC388-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC388-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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 : Thu Aug 31 20:22:10 EDT 2023
% Result : Unsatisfiable 0.64s 0.76s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 115
% Syntax : Number of formulae : 205 ( 35 unt; 72 typ; 0 def)
% Number of atoms : 357 ( 110 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 423 ( 199 ~; 224 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 82 ( 65 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 53 ( 53 usr; 7 con; 0-2 aty)
% Number of variables : 173 ( 29 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
nil: $i ).
tff(decl_23,type,
equalelemsP: $i > $o ).
tff(decl_24,type,
duplicatefreeP: $i > $o ).
tff(decl_25,type,
strictorderedP: $i > $o ).
tff(decl_26,type,
totalorderedP: $i > $o ).
tff(decl_27,type,
strictorderP: $i > $o ).
tff(decl_28,type,
totalorderP: $i > $o ).
tff(decl_29,type,
cyclefreeP: $i > $o ).
tff(decl_30,type,
ssList: $i > $o ).
tff(decl_31,type,
skac3: $i ).
tff(decl_32,type,
ssItem: $i > $o ).
tff(decl_33,type,
skac2: $i ).
tff(decl_34,type,
singletonP: $i > $o ).
tff(decl_35,type,
skaf83: $i > $i ).
tff(decl_36,type,
skaf82: $i > $i ).
tff(decl_37,type,
skaf81: $i > $i ).
tff(decl_38,type,
skaf80: $i > $i ).
tff(decl_39,type,
skaf79: $i > $i ).
tff(decl_40,type,
skaf78: $i > $i ).
tff(decl_41,type,
skaf77: $i > $i ).
tff(decl_42,type,
skaf76: $i > $i ).
tff(decl_43,type,
skaf75: $i > $i ).
tff(decl_44,type,
skaf74: $i > $i ).
tff(decl_45,type,
skaf73: $i > $i ).
tff(decl_46,type,
skaf72: $i > $i ).
tff(decl_47,type,
skaf71: $i > $i ).
tff(decl_48,type,
skaf70: $i > $i ).
tff(decl_49,type,
skaf69: $i > $i ).
tff(decl_50,type,
skaf68: $i > $i ).
tff(decl_51,type,
skaf67: $i > $i ).
tff(decl_52,type,
skaf66: $i > $i ).
tff(decl_53,type,
skaf65: $i > $i ).
tff(decl_54,type,
skaf64: $i > $i ).
tff(decl_55,type,
skaf63: $i > $i ).
tff(decl_56,type,
skaf62: $i > $i ).
tff(decl_57,type,
skaf61: $i > $i ).
tff(decl_58,type,
skaf60: $i > $i ).
tff(decl_59,type,
skaf59: $i > $i ).
tff(decl_60,type,
skaf58: $i > $i ).
tff(decl_61,type,
skaf57: $i > $i ).
tff(decl_62,type,
skaf56: $i > $i ).
tff(decl_63,type,
skaf55: $i > $i ).
tff(decl_64,type,
skaf54: $i > $i ).
tff(decl_65,type,
skaf53: $i > $i ).
tff(decl_66,type,
skaf52: $i > $i ).
tff(decl_67,type,
skaf51: $i > $i ).
tff(decl_68,type,
skaf50: $i > $i ).
tff(decl_69,type,
skaf49: $i > $i ).
tff(decl_70,type,
skaf44: $i > $i ).
tff(decl_71,type,
skaf48: ( $i * $i ) > $i ).
tff(decl_72,type,
skaf47: ( $i * $i ) > $i ).
tff(decl_73,type,
skaf46: ( $i * $i ) > $i ).
tff(decl_74,type,
skaf45: ( $i * $i ) > $i ).
tff(decl_75,type,
skaf43: ( $i * $i ) > $i ).
tff(decl_76,type,
skaf42: ( $i * $i ) > $i ).
tff(decl_77,type,
geq: ( $i * $i ) > $o ).
tff(decl_78,type,
segmentP: ( $i * $i ) > $o ).
tff(decl_79,type,
rearsegP: ( $i * $i ) > $o ).
tff(decl_80,type,
frontsegP: ( $i * $i ) > $o ).
tff(decl_81,type,
leq: ( $i * $i ) > $o ).
tff(decl_82,type,
lt: ( $i * $i ) > $o ).
tff(decl_83,type,
cons: ( $i * $i ) > $i ).
tff(decl_84,type,
memberP: ( $i * $i ) > $o ).
tff(decl_85,type,
app: ( $i * $i ) > $i ).
tff(decl_86,type,
tl: $i > $i ).
tff(decl_87,type,
hd: $i > $i ).
tff(decl_88,type,
neq: ( $i * $i ) > $o ).
tff(decl_89,type,
gt: ( $i * $i ) > $o ).
tff(decl_90,type,
sk1: $i ).
tff(decl_91,type,
sk2: $i ).
tff(decl_92,type,
sk3: $i ).
tff(decl_93,type,
sk4: $i ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause171) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_10,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
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/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(clause80,axiom,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(c_0_43,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_44,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_45,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_48,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_49,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_50,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_51,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[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_52,negated_conjecture,
( singletonP(sk1)
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_54,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_56,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( sk4 = nil
| singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_46])]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_59,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_60,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_55,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_61,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_62,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_63,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_57]),c_0_58])]) ).
cnf(c_0_64,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
clause171 ).
cnf(c_0_65,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_66,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_67,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_68,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_69,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_70,negated_conjecture,
( nil != sk2
| nil != sk1 ),
co1_10 ).
cnf(c_0_71,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_72,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_73,negated_conjecture,
( tl(sk1) = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_57]),c_0_58])]) ).
cnf(c_0_74,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_75,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_76,negated_conjecture,
( cons(hd(sk1),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_77,plain,
( skaf82(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67])])]),c_0_68]),c_0_69]) ).
cnf(c_0_78,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_79,negated_conjecture,
( sk1 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_70,c_0_50]) ).
cnf(c_0_80,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_71]) ).
cnf(c_0_81,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| sk4 = nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_58])]) ).
cnf(c_0_82,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_74]),c_0_75]) ).
cnf(c_0_83,negated_conjecture,
( app(sk1,nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_76]),c_0_46])]) ).
cnf(c_0_84,negated_conjecture,
( skaf82(sk1) = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_62]),c_0_46])]),c_0_63]) ).
cnf(c_0_85,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_62]),c_0_46])]),c_0_63]),c_0_79]) ).
cnf(c_0_86,negated_conjecture,
( sk1 = nil
| sk4 = nil
| memberP(sk1,hd(sk1))
| ~ ssItem(hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_46])]) ).
cnf(c_0_87,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_88,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_89,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_90,negated_conjecture,
( sk4 = nil
| frontsegP(sk1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_46]),c_0_58])]) ).
cnf(c_0_91,negated_conjecture,
( cons(skaf83(sk1),nil) = sk1
| sk4 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_84]),c_0_58])]),c_0_85]) ).
cnf(c_0_92,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_93,negated_conjecture,
( sk4 = nil
| sk1 = nil
| memberP(sk1,hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_58])]) ).
cnf(c_0_94,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_88]),c_0_68]) ).
cnf(c_0_95,negated_conjecture,
( app(sk1,skaf45(sk1,sk1)) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_58])]) ).
cnf(c_0_96,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_97,negated_conjecture,
( skaf83(sk1) = hd(sk1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_91]),c_0_66]),c_0_46])]) ).
cnf(c_0_98,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_92]) ).
cnf(c_0_99,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_100,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_101,negated_conjecture,
( sk4 = nil
| memberP(sk1,hd(sk1)) ),
inference(sr,[status(thm)],[c_0_93,c_0_85]) ).
cnf(c_0_102,negated_conjecture,
( sk4 = nil
| ssList(cons(X1,sk1))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]),c_0_58])]) ).
cnf(c_0_103,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_104,negated_conjecture,
( cons(hd(sk1),skaf82(sk1)) = sk1
| sk4 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_97]),c_0_58])]),c_0_85]) ).
cnf(c_0_105,plain,
( nil = 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(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_72]),c_0_99]),c_0_87]) ).
cnf(c_0_106,negated_conjecture,
( app(skaf42(sk1,hd(sk1)),cons(hd(sk1),skaf43(hd(sk1),sk1))) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_58])]),c_0_63]) ).
cnf(c_0_107,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_108,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_109,negated_conjecture,
( sk4 = nil
| ssList(app(sk1,sk1)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_76]),c_0_58])]),c_0_63]) ).
cnf(c_0_110,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_111,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_103]),c_0_75]) ).
cnf(c_0_112,negated_conjecture,
( app(sk1,skaf82(sk1)) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_104]),c_0_67])]) ).
cnf(c_0_113,negated_conjecture,
( sk4 = nil
| ~ duplicatefreeP(app(sk1,sk1)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),c_0_108]),c_0_58])]),c_0_85]),c_0_109]) ).
cnf(c_0_114,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_115,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_116,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
co1_8 ).
cnf(c_0_117,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_118,negated_conjecture,
( sk4 = nil
| memberP(app(X1,sk1),hd(sk1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_101]),c_0_58])]),c_0_63]) ).
cnf(c_0_119,negated_conjecture,
( sk4 = nil
| ssList(app(X1,sk1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_67]),c_0_58])]) ).
cnf(c_0_120,negated_conjecture,
( sk4 = nil
| ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_109]) ).
cnf(c_0_121,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause168 ).
cnf(c_0_122,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_115,c_0_48]) ).
cnf(c_0_123,negated_conjecture,
( cons(X1,nil) != sk1
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_116,c_0_50]) ).
cnf(c_0_124,negated_conjecture,
( sk4 = nil
| memberP(app(app(X1,sk1),X2),hd(sk1))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_120]) ).
cnf(c_0_125,negated_conjecture,
app(app(skaf47(sk4,sk1),sk1),skaf48(sk1,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_58]),c_0_54])]) ).
cnf(c_0_126,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_127,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_128,negated_conjecture,
( sk4 = nil
| ~ memberP(sk4,hd(sk1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_62]),c_0_63]) ).
cnf(c_0_129,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),c_0_127])]),c_0_128]) ).
cnf(c_0_130,axiom,
( nil = X1
| ~ segmentP(nil,X1)
| ~ ssList(X1) ),
clause80 ).
cnf(c_0_131,negated_conjecture,
segmentP(nil,sk1),
inference(rw,[status(thm)],[c_0_122,c_0_129]) ).
cnf(c_0_132,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_58])]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC388-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.09 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Aug 28 17:32:45 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.44 start to proof: theBenchmark
% 0.64/0.76 % Version : CSE_E---1.5
% 0.64/0.76 % Problem : theBenchmark.p
% 0.64/0.76 % Proof found
% 0.64/0.76 % SZS status Theorem for theBenchmark.p
% 0.64/0.76 % SZS output start Proof
% See solution above
% 0.64/0.77 % Total time : 0.311000 s
% 0.64/0.77 % SZS output end Proof
% 0.64/0.77 % Total time : 0.317000 s
%------------------------------------------------------------------------------