TSTP Solution File: SWC152+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC152+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 : n012.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:20:15 EDT 2023
% Result : Theorem 0.21s 0.66s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 96
% Syntax : Number of formulae : 155 ( 25 unt; 82 typ; 0 def)
% Number of atoms : 394 ( 68 equ)
% Maximal formula atoms : 42 ( 5 avg)
% Number of connectives : 507 ( 186 ~; 208 |; 61 &)
% ( 4 <=>; 48 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 68 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 63 ( 63 usr; 14 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn; 85 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
ssItem: $i > $o ).
tff(decl_23,type,
neq: ( $i * $i ) > $o ).
tff(decl_24,type,
ssList: $i > $o ).
tff(decl_25,type,
memberP: ( $i * $i ) > $o ).
tff(decl_26,type,
cons: ( $i * $i ) > $i ).
tff(decl_27,type,
app: ( $i * $i ) > $i ).
tff(decl_28,type,
singletonP: $i > $o ).
tff(decl_29,type,
nil: $i ).
tff(decl_30,type,
frontsegP: ( $i * $i ) > $o ).
tff(decl_31,type,
rearsegP: ( $i * $i ) > $o ).
tff(decl_32,type,
segmentP: ( $i * $i ) > $o ).
tff(decl_33,type,
cyclefreeP: $i > $o ).
tff(decl_34,type,
leq: ( $i * $i ) > $o ).
tff(decl_35,type,
totalorderP: $i > $o ).
tff(decl_36,type,
strictorderP: $i > $o ).
tff(decl_37,type,
lt: ( $i * $i ) > $o ).
tff(decl_38,type,
totalorderedP: $i > $o ).
tff(decl_39,type,
strictorderedP: $i > $o ).
tff(decl_40,type,
duplicatefreeP: $i > $o ).
tff(decl_41,type,
equalelemsP: $i > $o ).
tff(decl_42,type,
hd: $i > $i ).
tff(decl_43,type,
tl: $i > $i ).
tff(decl_44,type,
geq: ( $i * $i ) > $o ).
tff(decl_45,type,
gt: ( $i * $i ) > $o ).
tff(decl_46,type,
esk1_0: $i ).
tff(decl_47,type,
esk2_0: $i ).
tff(decl_48,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk5_1: $i > $i ).
tff(decl_51,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk10_1: $i > $i ).
tff(decl_56,type,
esk11_1: $i > $i ).
tff(decl_57,type,
esk12_1: $i > $i ).
tff(decl_58,type,
esk13_1: $i > $i ).
tff(decl_59,type,
esk14_1: $i > $i ).
tff(decl_60,type,
esk15_1: $i > $i ).
tff(decl_61,type,
esk16_1: $i > $i ).
tff(decl_62,type,
esk17_1: $i > $i ).
tff(decl_63,type,
esk18_1: $i > $i ).
tff(decl_64,type,
esk19_1: $i > $i ).
tff(decl_65,type,
esk20_1: $i > $i ).
tff(decl_66,type,
esk21_1: $i > $i ).
tff(decl_67,type,
esk22_1: $i > $i ).
tff(decl_68,type,
esk23_1: $i > $i ).
tff(decl_69,type,
esk24_1: $i > $i ).
tff(decl_70,type,
esk25_1: $i > $i ).
tff(decl_71,type,
esk26_1: $i > $i ).
tff(decl_72,type,
esk27_1: $i > $i ).
tff(decl_73,type,
esk28_1: $i > $i ).
tff(decl_74,type,
esk29_1: $i > $i ).
tff(decl_75,type,
esk30_1: $i > $i ).
tff(decl_76,type,
esk31_1: $i > $i ).
tff(decl_77,type,
esk32_1: $i > $i ).
tff(decl_78,type,
esk33_1: $i > $i ).
tff(decl_79,type,
esk34_1: $i > $i ).
tff(decl_80,type,
esk35_1: $i > $i ).
tff(decl_81,type,
esk36_1: $i > $i ).
tff(decl_82,type,
esk37_1: $i > $i ).
tff(decl_83,type,
esk38_1: $i > $i ).
tff(decl_84,type,
esk39_1: $i > $i ).
tff(decl_85,type,
esk40_1: $i > $i ).
tff(decl_86,type,
esk41_1: $i > $i ).
tff(decl_87,type,
esk42_1: $i > $i ).
tff(decl_88,type,
esk43_1: $i > $i ).
tff(decl_89,type,
esk44_1: $i > $i ).
tff(decl_90,type,
esk45_1: $i > $i ).
tff(decl_91,type,
esk46_1: $i > $i ).
tff(decl_92,type,
esk47_1: $i > $i ).
tff(decl_93,type,
esk48_0: $i ).
tff(decl_94,type,
esk49_0: $i ).
tff(decl_95,type,
esk50_0: $i ).
tff(decl_96,type,
esk51_0: $i ).
tff(decl_97,type,
esk52_0: $i ).
tff(decl_98,type,
esk53_0: $i ).
tff(decl_99,type,
esk54_0: $i ).
tff(decl_100,type,
esk55_0: $i ).
tff(decl_101,type,
esk56_0: $i ).
tff(decl_102,type,
esk57_0: $i ).
tff(decl_103,type,
esk58_0: $i ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ leq(X6,X5)
| ( ! [X10] :
( ~ ssItem(X10)
| ~ memberP(X8,X10)
| ( leq(X5,X10)
& leq(X10,X6) ) )
& leq(X5,X6) ) ) ) ) ) )
| ( ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != X3
| ~ memberP(X4,X11)
| ? [X12] :
( ssItem(X12)
& X11 != X12
& memberP(X4,X12)
& leq(X11,X12) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax8,axiom,
! [X1] :
( ssList(X1)
=> ( cyclefreeP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> ~ ( leq(X2,X3)
& leq(X3,X2) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax8) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(ax59,axiom,
! [X1] :
( ssItem(X1)
=> cyclefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax59) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax69) ).
fof(ax60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax60) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ leq(X6,X5)
| ( ! [X10] :
( ~ ssItem(X10)
| ~ memberP(X8,X10)
| ( leq(X5,X10)
& leq(X10,X6) ) )
& leq(X5,X6) ) ) ) ) ) )
| ( ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != X3
| ~ memberP(X4,X11)
| ? [X12] :
( ssItem(X12)
& X11 != X12
& memberP(X4,X12)
& leq(X11,X12) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_15,negated_conjecture,
! [X268] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& ssList(esk56_0)
& app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
& leq(esk53_0,esk52_0)
& ( ssItem(esk57_0)
| ~ leq(esk52_0,esk53_0) )
& ( memberP(esk55_0,esk57_0)
| ~ leq(esk52_0,esk53_0) )
& ( ~ leq(esk52_0,esk57_0)
| ~ leq(esk57_0,esk53_0)
| ~ leq(esk52_0,esk53_0) )
& ( nil = esk51_0
| ssItem(esk58_0) )
& ( nil = esk50_0
| ssItem(esk58_0) )
& ( nil = esk51_0
| cons(esk58_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk58_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk58_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk58_0) )
& ( nil = esk51_0
| ~ ssItem(X268)
| esk58_0 = X268
| ~ memberP(esk51_0,X268)
| ~ leq(esk58_0,X268) )
& ( nil = esk50_0
| ~ ssItem(X268)
| esk58_0 = X268
| ~ memberP(esk51_0,X268)
| ~ leq(esk58_0,X268) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
cnf(c_0_16,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X228,X229,X230] :
( ~ ssList(X228)
| ~ ssList(X229)
| ~ ssList(X230)
| app(app(X228,X229),X230) = app(X228,app(X229,X230)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_19,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X117,X118] :
( ~ ssList(X117)
| ~ ssItem(X118)
| ssList(cons(X118,X117)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_24,negated_conjecture,
( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_28,plain,
! [X226,X227] :
( ~ ssList(X226)
| ~ ssItem(X227)
| cons(X227,X226) = app(cons(X227,nil),X226) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_29,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_35,plain,
! [X136,X137] :
( ~ ssList(X136)
| ~ ssList(X137)
| ssList(app(X136,X137)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_36,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_26]),c_0_34])]) ).
cnf(c_0_37,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_38,plain,
! [X73,X74,X75,X76,X77,X78] :
( ( ~ totalorderedP(X73)
| ~ ssItem(X74)
| ~ ssItem(X75)
| ~ ssList(X76)
| ~ ssList(X77)
| ~ ssList(X78)
| app(app(X76,cons(X74,X77)),cons(X75,X78)) != X73
| leq(X74,X75)
| ~ ssList(X73) )
& ( ssItem(esk25_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssItem(esk26_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssList(esk27_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssList(esk28_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssList(esk29_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( app(app(esk27_1(X73),cons(esk25_1(X73),esk28_1(X73))),cons(esk26_1(X73),esk29_1(X73))) = X73
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ~ leq(esk25_1(X73),esk26_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])]) ).
cnf(c_0_39,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_22])]) ).
fof(c_0_40,plain,
! [X40,X41,X42,X43,X44,X45] :
( ( ~ cyclefreeP(X40)
| ~ ssItem(X41)
| ~ ssItem(X42)
| ~ ssList(X43)
| ~ ssList(X44)
| ~ ssList(X45)
| app(app(X43,cons(X41,X44)),cons(X42,X45)) != X40
| ~ leq(X41,X42)
| ~ leq(X42,X41)
| ~ ssList(X40) )
& ( ssItem(esk10_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssItem(esk11_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssList(esk12_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssList(esk13_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssList(esk14_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( app(app(esk12_1(X40),cons(esk10_1(X40),esk13_1(X40))),cons(esk11_1(X40),esk14_1(X40))) = X40
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( leq(esk10_1(X40),esk11_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( leq(esk11_1(X40),esk10_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax8])])])])]) ).
cnf(c_0_41,plain,
( leq(X2,X3)
| ~ totalorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_21]),c_0_27])]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_44,plain,
! [X205] :
( ~ ssItem(X205)
| totalorderedP(cons(X205,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
fof(c_0_45,plain,
! [X84,X85,X86,X87,X88,X89] :
( ( ~ strictorderedP(X84)
| ~ ssItem(X85)
| ~ ssItem(X86)
| ~ ssList(X87)
| ~ ssList(X88)
| ~ ssList(X89)
| app(app(X87,cons(X85,X88)),cons(X86,X89)) != X84
| lt(X85,X86)
| ~ ssList(X84) )
& ( ssItem(esk30_1(X84))
| strictorderedP(X84)
| ~ ssList(X84) )
& ( ssItem(esk31_1(X84))
| strictorderedP(X84)
| ~ ssList(X84) )
& ( ssList(esk32_1(X84))
| strictorderedP(X84)
| ~ ssList(X84) )
& ( ssList(esk33_1(X84))
| strictorderedP(X84)
| ~ ssList(X84) )
& ( ssList(esk34_1(X84))
| strictorderedP(X84)
| ~ ssList(X84) )
& ( app(app(esk32_1(X84),cons(esk30_1(X84),esk33_1(X84))),cons(esk31_1(X84),esk34_1(X84))) = X84
| strictorderedP(X84)
| ~ ssList(X84) )
& ( ~ lt(esk30_1(X84),esk31_1(X84))
| strictorderedP(X84)
| ~ ssList(X84) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])]) ).
cnf(c_0_46,plain,
( ~ cyclefreeP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ leq(X2,X3)
| ~ leq(X3,X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( leq(X1,X2)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_30]),c_0_32]),c_0_34])]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_43,c_0_17]) ).
cnf(c_0_50,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( nil = esk50_0
| cons(esk58_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_52,negated_conjecture,
( nil = esk50_0
| ssItem(esk58_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_53,plain,
! [X202] :
( ~ ssItem(X202)
| cyclefreeP(cons(X202,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])]) ).
cnf(c_0_54,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,plain,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ cyclefreeP(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_56,negated_conjecture,
leq(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_57,negated_conjecture,
( leq(esk52_0,esk53_0)
| ~ totalorderedP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_32]),c_0_21]),c_0_22]),c_0_34]),c_0_27])]) ).
cnf(c_0_58,negated_conjecture,
( esk50_0 = nil
| totalorderedP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_59,plain,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( ~ leq(esk52_0,esk53_0)
| ~ cyclefreeP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_48]),c_0_56]),c_0_49]),c_0_32]),c_0_21]),c_0_22]),c_0_34]),c_0_27])]) ).
cnf(c_0_62,negated_conjecture,
( esk50_0 = nil
| leq(esk52_0,esk53_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( esk50_0 = nil
| cyclefreeP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_51]),c_0_52]) ).
fof(c_0_64,plain,
! [X250,X251] :
( ( X250 != X251
| ~ lt(X250,X251)
| ~ ssItem(X251)
| ~ ssItem(X250) )
& ( leq(X250,X251)
| ~ lt(X250,X251)
| ~ ssItem(X251)
| ~ ssItem(X250) )
& ( X250 = X251
| ~ leq(X250,X251)
| lt(X250,X251)
| ~ ssItem(X251)
| ~ ssItem(X250) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax93])])])]) ).
cnf(c_0_65,negated_conjecture,
( lt(esk52_0,esk53_0)
| ~ strictorderedP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_48]),c_0_49]),c_0_32]),c_0_21]),c_0_22]),c_0_34]),c_0_27])]) ).
cnf(c_0_66,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_67,plain,
strictorderedP(nil),
inference(split_conjunct,[status(thm)],[ax69]) ).
cnf(c_0_68,plain,
cyclefreeP(nil),
inference(split_conjunct,[status(thm)],[ax60]) ).
cnf(c_0_69,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,negated_conjecture,
lt(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_71,negated_conjecture,
~ leq(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_66]),c_0_68])]) ).
cnf(c_0_72,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_69,c_0_70]),c_0_34]),c_0_27])]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC152+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.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 15:43:24 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.66 % Version : CSE_E---1.5
% 0.21/0.66 % Problem : theBenchmark.p
% 0.21/0.66 % Proof found
% 0.21/0.66 % SZS status Theorem for theBenchmark.p
% 0.21/0.66 % SZS output start Proof
% See solution above
% 0.21/0.67 % Total time : 0.070000 s
% 0.21/0.67 % SZS output end Proof
% 0.21/0.67 % Total time : 0.075000 s
%------------------------------------------------------------------------------