TSTP Solution File: SWC343-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC343-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 : n014.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:48 EDT 2023
% Result : Unsatisfiable 0.20s 0.82s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 107
% Syntax : Number of formulae : 178 ( 27 unt; 77 typ; 0 def)
% Number of atoms : 307 ( 135 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 386 ( 180 ~; 206 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 69 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 58 ( 58 usr; 8 con; 0-2 aty)
% Number of variables : 92 ( 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 > $i ).
tff(decl_96,type,
sk7: $i > $i ).
tff(decl_97,type,
sk8: $i > $i ).
tff(decl_98,type,
sk9: $i > $i ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
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_15,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_14,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
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_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_18,negated_conjecture,
( app(sk9(X1),cons(sk8(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ssList(sk9(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_16,negated_conjecture,
( ssItem(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
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_10,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssItem(X3)
| ~ ssList(X4)
| app(X4,cons(X3,nil)) != sk3
| ~ lt(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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(co1_19,negated_conjecture,
( lt(sk8(X1),sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(clause83,axiom,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(co1_21,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
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(co1_20,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(c_0_30,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_15 ).
cnf(c_0_33,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_35,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_36,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_14 ).
cnf(c_0_37,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_38,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_39,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| sk1 = nil
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_40,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_31]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_42,negated_conjecture,
( sk1 = nil
| ssList(sk7(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_33])]) ).
cnf(c_0_43,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_12 ).
cnf(c_0_44,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_37]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( app(cons(sk6(sk5),nil),sk7(sk5)) = sk5
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_46,negated_conjecture,
( sk1 = nil
| ssList(sk7(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( sk1 = nil
| ssItem(sk6(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_33])]) ).
cnf(c_0_48,negated_conjecture,
( app(sk9(X1),cons(sk8(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_18 ).
cnf(c_0_49,negated_conjecture,
( ssList(sk9(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_17 ).
cnf(c_0_50,negated_conjecture,
( ssItem(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_16 ).
cnf(c_0_51,negated_conjecture,
( sk1 = nil
| frontsegP(sk5,cons(sk6(sk5),nil))
| ~ ssList(cons(sk6(sk5),nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_52,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_53,axiom,
ssList(nil),
clause8 ).
cnf(c_0_54,negated_conjecture,
( sk1 = nil
| ssItem(sk6(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_41])]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssItem(X3)
| ~ ssList(X4)
| app(X4,cons(X3,nil)) != sk3
| ~ lt(X3,X1) ),
co1_10 ).
cnf(c_0_56,negated_conjecture,
( app(sk9(X1),cons(sk8(X1),nil)) = sk1
| sk1 = nil
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_33])]) ).
cnf(c_0_57,negated_conjecture,
( sk1 = nil
| ssList(sk9(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_33])]) ).
cnf(c_0_58,negated_conjecture,
( sk1 = nil
| ssItem(sk8(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_33])]) ).
cnf(c_0_59,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_60,negated_conjecture,
( sk1 = nil
| frontsegP(sk5,cons(sk6(sk5),nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( lt(sk8(X1),sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_19 ).
cnf(c_0_62,negated_conjecture,
( app(X1,cons(X2,nil)) != sk1
| app(cons(X3,nil),X4) != sk5
| ~ lt(X2,X3)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4) ),
inference(rw,[status(thm)],[c_0_55,c_0_31]) ).
cnf(c_0_63,negated_conjecture,
( app(sk9(sk5),cons(sk8(sk5),nil)) = sk1
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_40]),c_0_41])]) ).
cnf(c_0_64,negated_conjecture,
( sk1 = nil
| ssList(sk9(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_40]),c_0_41])]) ).
cnf(c_0_65,negated_conjecture,
( sk1 = nil
| ssItem(sk8(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_40]),c_0_41])]) ).
cnf(c_0_66,negated_conjecture,
( app(cons(sk6(sk5),nil),skaf45(sk5,cons(sk6(sk5),nil))) = sk5
| sk1 = nil
| ~ ssList(cons(sk6(sk5),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_41])]) ).
cnf(c_0_67,negated_conjecture,
( sk1 = nil
| lt(sk8(X1),sk6(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_33])]) ).
cnf(c_0_68,axiom,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause83 ).
cnf(c_0_69,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
co1_21 ).
cnf(c_0_70,negated_conjecture,
( nil = sk4
| nil != sk3 ),
co1_11 ).
cnf(c_0_71,negated_conjecture,
( sk1 = nil
| app(cons(X1,nil),X2) != sk5
| ~ lt(sk8(sk5),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]) ).
cnf(c_0_72,negated_conjecture,
( app(cons(sk6(sk5),nil),skaf45(sk5,cons(sk6(sk5),nil))) = sk5
| sk1 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_73,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_74,negated_conjecture,
( sk1 = nil
| lt(sk8(sk5),sk6(sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_40]),c_0_41])]) ).
cnf(c_0_75,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
co1_13 ).
cnf(c_0_76,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
clause61 ).
cnf(c_0_77,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_68]),c_0_53])]) ).
cnf(c_0_78,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
co1_20 ).
cnf(c_0_79,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_33])]) ).
cnf(c_0_80,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_81,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_82,negated_conjecture,
( sk2 = nil
| sk1 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_35]),c_0_31]) ).
cnf(c_0_83,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_71,c_0_72]),c_0_73])]),c_0_54]),c_0_74]) ).
cnf(c_0_84,negated_conjecture,
( ssItem(sk6(X1))
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_33])]) ).
cnf(c_0_85,plain,
( app(X1,skaf45(X1,X1)) = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_76]) ).
cnf(c_0_86,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_87,plain,
app(nil,skaf45(nil,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_77]),c_0_53])]) ).
cnf(c_0_88,negated_conjecture,
( ssList(sk7(X1))
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_33])]) ).
cnf(c_0_89,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_90,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_91,negated_conjecture,
( app(cons(sk6(nil),nil),sk7(nil)) = nil
| sk2 != sk1
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_53]),c_0_81])]) ).
cnf(c_0_92,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_93,negated_conjecture,
( ssItem(sk6(skaf45(sk1,sk1)))
| sk2 != sk1
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_73]),c_0_81])]) ).
cnf(c_0_94,plain,
skaf45(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_73]),c_0_53])]) ).
cnf(c_0_95,negated_conjecture,
( ssList(sk7(skaf45(sk1,sk1)))
| sk2 != sk1
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_85]),c_0_73]),c_0_81])]) ).
cnf(c_0_96,plain,
( app(cons(X1,X2),X3) != nil
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_38]) ).
cnf(c_0_97,negated_conjecture,
app(cons(sk6(nil),nil),sk7(nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_83])]),c_0_92])]) ).
cnf(c_0_98,negated_conjecture,
ssItem(sk6(nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_83]),c_0_83]),c_0_94]),c_0_83])]),c_0_92])]) ).
cnf(c_0_99,negated_conjecture,
ssList(sk7(nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_83]),c_0_83]),c_0_94]),c_0_83])]),c_0_92])]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]),c_0_99]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC343-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.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 17:54:15 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.82 % Version : CSE_E---1.5
% 0.20/0.82 % Problem : theBenchmark.p
% 0.20/0.82 % Proof found
% 0.20/0.82 % SZS status Theorem for theBenchmark.p
% 0.20/0.82 % SZS output start Proof
% See solution above
% 0.20/0.83 % Total time : 0.247000 s
% 0.20/0.83 % SZS output end Proof
% 0.20/0.83 % Total time : 0.253000 s
%------------------------------------------------------------------------------