TSTP Solution File: SWC223+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC223+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 : n008.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:51 EDT 2023
% Result : Theorem 28.63s 28.92s
% Output : CNFRefutation 28.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 85
% Syntax : Number of formulae : 130 ( 7 unt; 76 typ; 0 def)
% Number of atoms : 251 ( 59 equ)
% Maximal formula atoms : 46 ( 4 avg)
% Number of connectives : 327 ( 130 ~; 133 |; 42 &)
% ( 1 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 88 ( 69 >; 19 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 57 ( 57 usr; 7 con; 0-3 aty)
% Number of variables : 97 ( 0 sgn; 39 !; 17 ?; 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_3: ( $i * $i * $i ) > $i ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(app(X10,cons(X9,nil)),X11) = X3
& ? [X12] :
( ssItem(X12)
& ( ( ~ leq(X9,X12)
& memberP(X11,X12) )
| ( ~ leq(X12,X9)
& memberP(X10,X12) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(c_0_9,plain,
! [X131,X132] :
( ~ ssList(X131)
| ~ ssItem(X132)
| hd(cons(X132,X131)) = X132 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
fof(c_0_10,plain,
! [X23,X25] :
( ( ssItem(esk5_1(X23))
| ~ singletonP(X23)
| ~ ssList(X23) )
& ( cons(esk5_1(X23),nil) = X23
| ~ singletonP(X23)
| ~ ssList(X23) )
& ( ~ ssItem(X25)
| cons(X25,nil) != X23
| singletonP(X23)
| ~ ssList(X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
cnf(c_0_11,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,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_17,plain,
( esk5_1(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_21,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_22,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
fof(c_0_23,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(app(X10,cons(X9,nil)),X11) = X3
& ? [X12] :
( ssItem(X12)
& ( ( ~ leq(X9,X12)
& memberP(X11,X12) )
| ( ~ leq(X12,X9)
& memberP(X10,X12) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_24,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
fof(c_0_26,negated_conjecture,
! [X261,X262,X263,X265,X266,X267,X268] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& nil != esk48_0
& ( ssItem(esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( memberP(X262,esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( memberP(X263,esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( leq(X261,esk52_3(X261,X262,X263))
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( ~ leq(esk52_3(X261,X262,X263),X261)
| ~ ssList(X263)
| app(app(X262,cons(X261,nil)),X263) != esk48_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( leq(X265,X268)
| ~ memberP(X267,X268)
| ~ ssItem(X268)
| ~ ssList(X267)
| app(app(X266,cons(X265,nil)),X267) != esk50_0
| ~ ssList(X266)
| ~ ssItem(X265) )
& ( leq(X268,X265)
| ~ memberP(X266,X268)
| ~ ssItem(X268)
| ~ ssList(X267)
| app(app(X266,cons(X265,nil)),X267) != esk50_0
| ~ ssList(X266)
| ~ ssItem(X265) ) ),
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_23])])])])]) ).
fof(c_0_27,plain,
! [X141] :
( ~ ssList(X141)
| app(nil,X141) = X141 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_28,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_13])]) ).
cnf(c_0_29,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_13])]) ).
cnf(c_0_30,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| ~ ssList(X3)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_28]),c_0_13])]),c_0_29]) ).
fof(c_0_33,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_34,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( memberP(nil,esk52_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_13])]),c_0_32]) ).
cnf(c_0_36,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_37,plain,
! [X125] :
( ( ssList(esk44_1(X125))
| nil = X125
| ~ ssList(X125) )
& ( ssItem(esk45_1(X125))
| nil = X125
| ~ ssList(X125) )
& ( cons(esk45_1(X125),esk44_1(X125)) = X125
| nil = X125
| ~ ssList(X125) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_38,negated_conjecture,
( ssItem(esk52_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_13])]),c_0_32]) ).
fof(c_0_39,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_40,negated_conjecture,
( memberP(nil,esk52_3(X1,nil,X2))
| cons(X1,X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( ssItem(esk52_3(X1,nil,X2))
| cons(X1,X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
fof(c_0_45,plain,
! [X163] :
( ~ ssItem(X163)
| ~ memberP(nil,X163) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
( nil = X1
| memberP(nil,esk52_3(esk45_1(X1),nil,esk44_1(X1)))
| X1 != esk48_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_48,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_49,negated_conjecture,
( nil = X1
| ssItem(esk52_3(esk45_1(X1),nil,esk44_1(X1)))
| X1 != esk48_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
memberP(nil,esk52_3(esk45_1(esk48_0),nil,esk44_1(esk48_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_47])]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
ssItem(esk52_3(esk45_1(esk48_0),nil,esk44_1(esk48_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_47])]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC223+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 17:35:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 28.63/28.92 % Version : CSE_E---1.5
% 28.63/28.92 % Problem : theBenchmark.p
% 28.63/28.92 % Proof found
% 28.63/28.92 % SZS status Theorem for theBenchmark.p
% 28.63/28.92 % SZS output start Proof
% See solution above
% 28.63/28.93 % Total time : 28.327000 s
% 28.63/28.93 % SZS output end Proof
% 28.63/28.93 % Total time : 28.334000 s
%------------------------------------------------------------------------------