TSTP Solution File: SWC340-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC340-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 : n005.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:47 EDT 2023
% Result : Unsatisfiable 105.01s 105.13s
% Output : CNFRefutation 105.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 101
% Syntax : Number of formulae : 159 ( 31 unt; 72 typ; 0 def)
% Number of atoms : 260 ( 22 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 346 ( 173 ~; 173 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 137 ( 22 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(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(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause183,axiom,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause183) ).
cnf(clause114,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(clause164,axiom,
( totalorderedP(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause164) ).
cnf(clause27,axiom,
ssList(skaf68(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(clause28,axiom,
ssList(skaf67(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(clause29,axiom,
ssList(skaf66(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(clause103,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(co1_9,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause91,axiom,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause91) ).
cnf(clause165,axiom,
( strictorderP(X1)
| app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause165) ).
cnf(clause32,axiom,
ssList(skaf63(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause32) ).
cnf(clause33,axiom,
ssList(skaf62(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause33) ).
cnf(clause34,axiom,
ssList(skaf61(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause34) ).
cnf(clause93,axiom,
( strictorderP(X1)
| ~ lt(skaf59(X1),skaf60(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause93) ).
cnf(co1_8,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_29,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_30,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_29]) ).
cnf(c_0_31,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_32,axiom,
ssList(nil),
clause8 ).
cnf(c_0_33,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_34,plain,
( ~ ssItem(X1)
| ~ ssList(app(cons(X1,X2),cons(X1,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(cons(X1,X2),cons(X1,X3))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]) ).
cnf(c_0_35,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_36,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,cons(X1,X2)))
| ~ ssList(X2)
| ~ duplicatefreeP(cons(X1,cons(X1,X2))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32])]),c_0_33]) ).
cnf(c_0_37,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ duplicatefreeP(cons(X1,cons(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_33]) ).
cnf(c_0_38,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_39,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_40,plain,
( ~ singletonP(X1)
| ~ ssList(X1)
| ~ duplicatefreeP(cons(skaf44(X1),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_32])]) ).
cnf(c_0_41,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_42,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_43,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(cons(skaf44(X2),X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_45,plain,
( ssItem(X1)
| ~ singletonP(X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_39])]) ).
cnf(c_0_46,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_32])]) ).
cnf(c_0_47,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(cons(X2,nil)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
clause181 ).
cnf(c_0_49,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_32])]) ).
cnf(c_0_50,axiom,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
clause183 ).
cnf(c_0_51,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_52,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_53,plain,
( lt(X1,X2)
| lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5))) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause114 ).
cnf(c_0_55,plain,
( lt(X1,X2)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52])]) ).
cnf(c_0_56,axiom,
( totalorderedP(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| ~ ssList(X1) ),
clause164 ).
cnf(c_0_57,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_58,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_59,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_60,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause103 ).
cnf(c_0_61,plain,
( lt(X1,X2)
| lt(X2,X1)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_52]),c_0_52])]) ).
cnf(c_0_62,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
co1_9 ).
cnf(c_0_63,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_64,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_65,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_66,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_52]),c_0_52])]) ).
cnf(c_0_67,plain,
( lt(skaf64(X1),skaf65(X1))
| totalorderedP(X1)
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_68,plain,
( leq(X1,X2)
| ~ lt(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_52]),c_0_52])]) ).
cnf(c_0_69,plain,
( lt(skaf64(X1),skaf65(X1))
| lt(skaf65(X1),skaf64(X1))
| totalorderedP(X1)
| ~ ssList(X1)
| ~ strictorderP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_56]),c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_70,axiom,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
clause91 ).
cnf(c_0_71,axiom,
( strictorderP(X1)
| app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1
| ~ ssList(X1) ),
clause165 ).
cnf(c_0_72,axiom,
ssList(skaf63(X1)),
clause32 ).
cnf(c_0_73,axiom,
ssList(skaf62(X1)),
clause33 ).
cnf(c_0_74,axiom,
ssList(skaf61(X1)),
clause34 ).
cnf(c_0_75,axiom,
( strictorderP(X1)
| ~ lt(skaf59(X1),skaf60(X1))
| ~ ssList(X1) ),
clause93 ).
cnf(c_0_76,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ totalorderedP(sk1) ),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_77,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_78,plain,
( totalorderedP(X1)
| ~ lt(skaf65(X1),skaf64(X1))
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_79,plain,
( lt(skaf65(X1),skaf64(X1))
| totalorderedP(X1)
| ~ ssList(X1)
| ~ strictorderP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_80,plain,
( strictorderP(X1)
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_71]),c_0_72]),c_0_73]),c_0_74])]),c_0_75]) ).
cnf(c_0_81,negated_conjecture,
strictorderedP(sk3),
co1_8 ).
cnf(c_0_82,negated_conjecture,
~ totalorderedP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_83,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_84,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_85,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_81,c_0_65]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_85])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SWC340-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.32 % Computer : n005.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Aug 28 18:23:53 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.58 start to proof: theBenchmark
% 105.01/105.13 % Version : CSE_E---1.5
% 105.01/105.13 % Problem : theBenchmark.p
% 105.01/105.13 % Proof found
% 105.01/105.13 % SZS status Theorem for theBenchmark.p
% 105.01/105.13 % SZS output start Proof
% See solution above
% 105.01/105.14 % Total time : 104.494000 s
% 105.01/105.14 % SZS output end Proof
% 105.01/105.14 % Total time : 104.503000 s
%------------------------------------------------------------------------------