TSTP Solution File: SWC063-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC063-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 : 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 : Thu Aug 31 20:19:30 EDT 2023
% Result : Unsatisfiable 0.63s 0.89s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 103
% Syntax : Number of formulae : 180 ( 20 unt; 74 typ; 0 def)
% Number of atoms : 267 ( 102 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 295 ( 134 ~; 161 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 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 : 55 ( 55 usr; 9 con; 0-2 aty)
% Number of variables : 80 ( 4 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 ).
tff(decl_94,type,
sk5: $i ).
tff(decl_95,type,
sk6: $i ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
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(co1_11,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_9,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
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(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_10,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
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(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause83,axiom,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_14,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_29,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
co1_12 ).
cnf(c_0_30,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_31,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_32,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_33,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_34,negated_conjecture,
( sk4 = nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_36,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_31]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( sk4 = nil
| ssList(sk6) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_8 ).
cnf(c_0_40,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,negated_conjecture,
( sk4 = nil
| ssItem(sk5) ),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_45,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_46,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_47,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk6) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( X1 = cons(sk5,nil)
| sk4 = nil
| app(sk6,X1) != sk4
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_38]) ).
cnf(c_0_50,negated_conjecture,
( app(sk6,skaf45(sk4,sk6)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_38]) ).
cnf(c_0_51,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_52,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_53,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_54,negated_conjecture,
( skaf45(sk4,sk6) = cons(sk5,nil)
| sk4 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_55,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_57,negated_conjecture,
( skaf45(sk4,sk6) = cons(sk5,nil)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_58,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk1
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_55,c_0_34]) ).
cnf(c_0_59,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
co1_13 ).
cnf(c_0_60,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( sk4 = nil
| ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_51,c_0_57]) ).
cnf(c_0_62,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
clause61 ).
cnf(c_0_63,negated_conjecture,
( sk4 = nil
| frontsegP(sk1,cons(sk5,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_58]),c_0_38]) ).
cnf(c_0_64,negated_conjecture,
( sk4 = nil
| ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_30]),c_0_30]) ).
cnf(c_0_65,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_66,negated_conjecture,
( sk4 = nil
| segmentP(app(sk1,X1),sk6)
| ~ ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_58]),c_0_38]),c_0_61]) ).
cnf(c_0_67,plain,
( app(X1,skaf45(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_69,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_70,negated_conjecture,
( sk4 = nil
| frontsegP(sk1,cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_71,negated_conjecture,
( sk4 = nil
| nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_42])]) ).
cnf(c_0_72,negated_conjecture,
( sk4 = nil
| segmentP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_51])]) ).
cnf(c_0_73,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_69]),c_0_42])]),c_0_32]) ).
cnf(c_0_74,negated_conjecture,
( app(cons(sk5,nil),skaf45(sk1,cons(sk5,nil))) = sk1
| sk4 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_70]),c_0_68])]) ).
cnf(c_0_75,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_76,negated_conjecture,
( sk6 = nil
| sk4 = nil
| ~ segmentP(sk4,sk6) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_38]) ).
cnf(c_0_77,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk6) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_50]),c_0_51])]),c_0_38]) ).
cnf(c_0_78,negated_conjecture,
( app(cons(sk5,nil),skaf45(sk1,cons(sk5,nil))) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_79,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_80,negated_conjecture,
( sk4 = nil
| segmentP(app(sk4,X1),cons(sk5,nil))
| ~ ssList(app(sk4,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_37]),c_0_38]),c_0_61]) ).
cnf(c_0_81,negated_conjecture,
( cons(sk5,sk6) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_75]),c_0_38]),c_0_43]) ).
cnf(c_0_82,negated_conjecture,
( sk4 = nil
| sk6 = nil ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_83,axiom,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause83 ).
cnf(c_0_84,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_85,negated_conjecture,
( cons(sk5,skaf45(sk1,cons(sk5,nil))) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_78]),c_0_51])]),c_0_43]) ).
cnf(c_0_86,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
clause57 ).
cnf(c_0_87,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_79,c_0_53]) ).
cnf(c_0_88,negated_conjecture,
( sk4 = nil
| segmentP(sk4,cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_67]),c_0_48]),c_0_51])]) ).
cnf(c_0_89,negated_conjecture,
( cons(sk5,nil) = sk1
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_90,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_83]),c_0_42])]) ).
cnf(c_0_91,negated_conjecture,
( sk4 = nil
| skaf45(sk1,cons(sk5,nil)) != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_51])]),c_0_43]) ).
cnf(c_0_92,negated_conjecture,
( sk1 = nil
| ~ segmentP(sk4,sk1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_86]),c_0_68])]),c_0_87]) ).
cnf(c_0_93,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_94,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_95,plain,
app(nil,skaf45(nil,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_90]),c_0_42])]) ).
cnf(c_0_96,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_14 ).
cnf(c_0_97,negated_conjecture,
( sk4 = nil
| skaf45(sk1,sk1) != sk1 ),
inference(spm,[status(thm)],[c_0_91,c_0_89]) ).
cnf(c_0_98,negated_conjecture,
sk1 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_87]) ).
cnf(c_0_99,plain,
skaf45(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_51]),c_0_42])]) ).
cnf(c_0_100,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_101,negated_conjecture,
( neq(sk4,nil)
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_96,c_0_30]) ).
cnf(c_0_102,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98]),c_0_98]),c_0_99]),c_0_98])]) ).
cnf(c_0_103,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_100]) ).
cnf(c_0_104,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_98])]),c_0_102]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC063-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 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 : Mon Aug 28 15:02:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.63/0.89 % Version : CSE_E---1.5
% 0.63/0.89 % Problem : theBenchmark.p
% 0.63/0.89 % Proof found
% 0.63/0.89 % SZS status Theorem for theBenchmark.p
% 0.63/0.89 % SZS output start Proof
% See solution above
% 0.86/0.90 % Total time : 0.313000 s
% 0.86/0.90 % SZS output end Proof
% 0.86/0.90 % Total time : 0.319000 s
%------------------------------------------------------------------------------