TSTP Solution File: SWC363-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC363-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 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 : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 20:21:58 EDT 2023
% Result : Unsatisfiable 3.90s 3.99s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 108
% Syntax : Number of formulae : 193 ( 43 unt; 73 typ; 0 def)
% Number of atoms : 287 ( 69 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 336 ( 169 ~; 167 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 54 ( 54 usr; 8 con; 0-2 aty)
% Number of variables : 143 ( 17 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 ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_12,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause152,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(co1_8,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_0_35,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_36,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_37,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_38,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_40,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_41,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_42,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_43,negated_conjecture,
cons(sk5,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_46,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_47,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_40]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( frontsegP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_51,axiom,
ssList(nil),
clause8 ).
cnf(c_0_52,negated_conjecture,
( memberP(sk4,sk5)
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_53,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_54,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_55,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_56,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_57,negated_conjecture,
frontsegP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_51])]) ).
cnf(c_0_58,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_59,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_60,negated_conjecture,
memberP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_38])]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_53,c_0_36]) ).
cnf(c_0_62,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_63,negated_conjecture,
hd(sk3) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_43]),c_0_44]),c_0_51])]) ).
cnf(c_0_64,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_44]),c_0_51])]) ).
cnf(c_0_65,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_66,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_67,negated_conjecture,
app(sk3,skaf45(sk3,sk3)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_49])]) ).
cnf(c_0_68,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_69,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_58]) ).
cnf(c_0_70,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_44]),c_0_61])]) ).
cnf(c_0_71,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_72,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_73,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_74,negated_conjecture,
( hd(cons(sk5,X1)) = sk5
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_48]),c_0_63]),c_0_49])]),c_0_64]) ).
cnf(c_0_75,negated_conjecture,
( ssList(cons(sk5,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_49])]) ).
cnf(c_0_76,negated_conjecture,
( cons(sk5,X1) != nil
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_48]),c_0_49])]),c_0_64]) ).
cnf(c_0_77,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_78,negated_conjecture,
tl(sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_43]),c_0_44]),c_0_51])]) ).
cnf(c_0_79,negated_conjecture,
cons(sk5,skaf45(sk3,sk3)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_67]),c_0_68])]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(app(sk4,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk4,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_44]),c_0_71]),c_0_72])]) ).
cnf(c_0_81,negated_conjecture,
( cons(sk5,tl(cons(sk5,X1))) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( tl(cons(sk5,X1)) = app(nil,X1)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_48]),c_0_78]),c_0_49])]),c_0_64]) ).
cnf(c_0_83,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_84,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause137 ).
cnf(c_0_85,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_86,negated_conjecture,
skaf45(sk3,sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_79]),c_0_78]),c_0_44]),c_0_68])]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(app(sk4,sk3))
| ~ duplicatefreeP(app(sk4,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_43]),c_0_51])]) ).
cnf(c_0_88,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_89,negated_conjecture,
( cons(sk5,app(nil,X1)) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_90,negated_conjecture,
( ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_82]),c_0_75]),c_0_76]) ).
cnf(c_0_91,plain,
( frontsegP(app(X1,X2),nil)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_51])]) ).
cnf(c_0_92,negated_conjecture,
app(sk3,nil) = sk3,
inference(rw,[status(thm)],[c_0_67,c_0_86]) ).
cnf(c_0_93,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,sk3)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
( tl(cons(sk5,X1)) = app(nil,app(nil,X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_89]),c_0_90]) ).
cnf(c_0_95,negated_conjecture,
frontsegP(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_51]),c_0_49])]) ).
cnf(c_0_96,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_97,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_98,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_41]),c_0_61]),c_0_49])]) ).
cnf(c_0_99,negated_conjecture,
( app(nil,app(nil,X1)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_94]),c_0_44])]) ).
cnf(c_0_100,plain,
( app(nil,skaf45(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_85]),c_0_51])]) ).
cnf(c_0_101,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_102,negated_conjecture,
app(nil,skaf45(sk3,nil)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_95]),c_0_51]),c_0_49])]) ).
cnf(c_0_103,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_96]) ).
cnf(c_0_104,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98])]) ).
cnf(c_0_105,negated_conjecture,
( skaf45(X1,nil) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_68])]) ).
cnf(c_0_106,negated_conjecture,
skaf45(sk3,nil) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_68])]) ).
cnf(c_0_107,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_108,negated_conjecture,
( segmentP(app(X1,X2),app(nil,X1))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_99]),c_0_51])]),c_0_41]),c_0_90]) ).
cnf(c_0_109,negated_conjecture,
( app(sk3,skaf45(cons(sk5,X1),sk3)) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_50]),c_0_49])]),c_0_104]) ).
cnf(c_0_110,negated_conjecture,
app(nil,sk3) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_49])]) ).
cnf(c_0_111,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_107]),c_0_51])]),c_0_41]) ).
cnf(c_0_112,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause152 ).
cnf(c_0_113,negated_conjecture,
( segmentP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),c_0_68]),c_0_49])]) ).
cnf(c_0_114,negated_conjecture,
( segmentP(sk4,cons(sk5,skaf43(sk5,sk4)))
| ~ ssList(cons(sk5,skaf43(sk5,sk4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_70]),c_0_72])]) ).
cnf(c_0_115,negated_conjecture,
~ segmentP(sk2,sk1),
co1_8 ).
cnf(c_0_116,negated_conjecture,
( segmentP(X1,sk3)
| ~ segmentP(X1,cons(sk5,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_49])]),c_0_104]) ).
cnf(c_0_117,negated_conjecture,
segmentP(sk4,cons(sk5,skaf43(sk5,sk4))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_104]),c_0_71])]) ).
cnf(c_0_118,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_36]),c_0_46]) ).
cnf(c_0_119,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_61]),c_0_71])]),c_0_118]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC363-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n007.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 17:48:28 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 3.90/3.99 % Version : CSE_E---1.5
% 3.90/3.99 % Problem : theBenchmark.p
% 3.90/3.99 % Proof found
% 3.90/3.99 % SZS status Theorem for theBenchmark.p
% 3.90/3.99 % SZS output start Proof
% See solution above
% 3.94/3.99 % Total time : 3.415000 s
% 3.94/3.99 % SZS output end Proof
% 3.94/3.99 % Total time : 3.421000 s
%------------------------------------------------------------------------------