TSTP Solution File: SWV220+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 21:37:04 EDT 2023
% Result : Theorem 0.20s 0.72s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 85
% Syntax : Number of formulae : 149 ( 65 unt; 68 typ; 0 def)
% Number of atoms : 259 ( 193 equ)
% Maximal formula atoms : 53 ( 3 avg)
% Number of connectives : 289 ( 111 ~; 42 |; 128 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 150 ( 53 >; 97 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 2 prp; 0-4 aty)
% Number of functors : 61 ( 61 usr; 14 con; 0-7 aty)
% Number of variables : 62 ( 3 sgn; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
gt: ( $i * $i ) > $o ).
tff(decl_23,type,
leq: ( $i * $i ) > $o ).
tff(decl_24,type,
lt: ( $i * $i ) > $o ).
tff(decl_25,type,
geq: ( $i * $i ) > $o ).
tff(decl_26,type,
pred: $i > $i ).
tff(decl_27,type,
succ: $i > $i ).
tff(decl_28,type,
n0: $i ).
tff(decl_29,type,
uniform_int_rnd: ( $i * $i ) > $i ).
tff(decl_30,type,
dim: ( $i * $i ) > $i ).
tff(decl_31,type,
tptp_const_array1: ( $i * $i ) > $i ).
tff(decl_32,type,
a_select2: ( $i * $i ) > $i ).
tff(decl_33,type,
tptp_const_array2: ( $i * $i * $i ) > $i ).
tff(decl_34,type,
a_select3: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
trans: $i > $i ).
tff(decl_36,type,
inv: $i > $i ).
tff(decl_37,type,
tptp_update3: ( $i * $i * $i * $i ) > $i ).
tff(decl_38,type,
tptp_madd: ( $i * $i ) > $i ).
tff(decl_39,type,
tptp_msub: ( $i * $i ) > $i ).
tff(decl_40,type,
tptp_mmul: ( $i * $i ) > $i ).
tff(decl_41,type,
tptp_minus_1: $i ).
tff(decl_42,type,
sum: ( $i * $i * $i ) > $i ).
tff(decl_43,type,
tptp_float_0_0: $i ).
tff(decl_44,type,
n1: $i ).
tff(decl_45,type,
plus: ( $i * $i ) > $i ).
tff(decl_46,type,
n2: $i ).
tff(decl_47,type,
n3: $i ).
tff(decl_48,type,
n4: $i ).
tff(decl_49,type,
n5: $i ).
tff(decl_50,type,
minus: ( $i * $i ) > $i ).
tff(decl_51,type,
tptp_update2: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
true: $o ).
tff(decl_53,type,
def: $i ).
tff(decl_54,type,
use: $i ).
tff(decl_55,type,
n400: $i ).
tff(decl_56,type,
divide: ( $i * $i ) > $i ).
tff(decl_57,type,
sigma: $i ).
tff(decl_58,type,
times: ( $i * $i ) > $i ).
tff(decl_59,type,
epred1_4: ( $i * $i * $i * $i ) > $o ).
tff(decl_60,type,
epred2_2: ( $i * $i ) > $o ).
tff(decl_61,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_62,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_65,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_66,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_68,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_69,type,
esk9_3: ( $i * $i * $i ) > $i ).
tff(decl_70,type,
esk10_3: ( $i * $i * $i ) > $i ).
tff(decl_71,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_72,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_73,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
esk14_3: ( $i * $i * $i ) > $i ).
tff(decl_75,type,
esk15_3: ( $i * $i * $i ) > $i ).
tff(decl_76,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_77,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_78,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_79,type,
esk19_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_80,type,
esk20_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_81,type,
esk21_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_82,type,
esk22_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_83,type,
esk23_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_84,type,
esk24_0: $i ).
tff(decl_85,type,
esk25_0: $i ).
tff(decl_86,type,
esk26_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_87,type,
esk27_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_88,type,
esk28_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_89,type,
esk29_4: ( $i * $i * $i * $i ) > $i ).
fof(succ_plus_2_r,axiom,
! [X1] : plus(X1,n2) = succ(succ(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_2_r) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(quaternion_ds1_symm_0361,conjecture,
! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> ( ( ~ ( n0 = X18
& n4 = X14 )
& ~ ( n0 = X18
& n5 = X14 )
& ~ ( n1 = X18
& n4 = X14 )
& ~ ( n1 = X18
& n5 = X14 )
& ~ ( n2 = X14
& n5 = X18 )
& ~ ( n2 = X18
& n4 = X14 )
& ~ ( n2 = X18
& n5 = X14 )
& ~ ( n3 = X14
& n4 = X18 )
& ~ ( n3 = X14
& n5 = X18 )
& ~ ( n3 = X18
& n4 = X14 )
& ~ ( n3 = X18
& n5 = X14 )
& ~ ( n4 = X14
& n4 = X18 )
& ~ ( n4 = X14
& n5 = X18 )
& ~ ( n4 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n5 = X18 )
& n1 = X14
& n3 = X14
& n3 = X18
& n5 = X18 )
=> times(divide(n1,n400),a_select2(sigma,n3)) = n0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0361) ).
fof(succ_plus_3_r,axiom,
! [X1] : plus(X1,n3) = succ(succ(succ(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_3_r) ).
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(succ_plus_4_r,axiom,
! [X1] : plus(X1,n4) = succ(succ(succ(succ(X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_4_r) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_3) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(succ_plus_4_l,axiom,
! [X1] : plus(n4,X1) = succ(succ(succ(succ(X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_4_l) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_5) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(gt_4_3,axiom,
gt(n4,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_3) ).
fof(c_0_16,plain,
! [X14,X18] :
( epred2_2(X18,X14)
<=> ( ~ ( n0 = X18
& n4 = X14 )
& ~ ( n0 = X18
& n5 = X14 )
& ~ ( n1 = X18
& n4 = X14 )
& ~ ( n1 = X18
& n5 = X14 )
& ~ ( n2 = X14
& n5 = X18 )
& ~ ( n2 = X18
& n4 = X14 )
& ~ ( n2 = X18
& n5 = X14 )
& ~ ( n3 = X14
& n4 = X18 )
& ~ ( n3 = X14
& n5 = X18 )
& ~ ( n3 = X18
& n4 = X14 )
& ~ ( n3 = X18
& n5 = X14 )
& ~ ( n4 = X14
& n4 = X18 )
& ~ ( n4 = X14
& n5 = X18 )
& ~ ( n4 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n5 = X18 )
& n1 = X14
& n3 = X14
& n3 = X18
& n5 = X18 ) ),
introduced(definition) ).
fof(c_0_17,plain,
! [X137] : plus(X137,n2) = succ(succ(X137)),
inference(variable_rename,[status(thm)],[succ_plus_2_r]) ).
fof(c_0_18,plain,
! [X135] : plus(X135,n1) = succ(X135),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_19,plain,
! [X136] : plus(n1,X136) = succ(X136),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
fof(c_0_20,plain,
! [X14,X18] :
( epred2_2(X18,X14)
=> ( ~ ( n0 = X18
& n4 = X14 )
& ~ ( n0 = X18
& n5 = X14 )
& ~ ( n1 = X18
& n4 = X14 )
& ~ ( n1 = X18
& n5 = X14 )
& ~ ( n2 = X14
& n5 = X18 )
& ~ ( n2 = X18
& n4 = X14 )
& ~ ( n2 = X18
& n5 = X14 )
& ~ ( n3 = X14
& n4 = X18 )
& ~ ( n3 = X14
& n5 = X18 )
& ~ ( n3 = X18
& n4 = X14 )
& ~ ( n3 = X18
& n5 = X14 )
& ~ ( n4 = X14
& n4 = X18 )
& ~ ( n4 = X14
& n5 = X18 )
& ~ ( n4 = X18
& n5 = X14 )
& ~ ( n5 = X14
& n5 = X18 )
& n1 = X14
& n3 = X14
& n3 = X18
& n5 = X18 ) ),
inference(split_equiv,[status(thm)],[c_0_16]) ).
fof(c_0_21,negated_conjecture,
~ ! [X14,X18] :
( ( leq(n0,X14)
& leq(n0,X18)
& leq(X14,n5)
& leq(X18,n5) )
=> ( epred2_2(X18,X14)
=> times(divide(n1,n400),a_select2(sigma,n3)) = n0 ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0361]),c_0_16]) ).
fof(c_0_22,plain,
! [X139] : plus(X139,n3) = succ(succ(succ(X139))),
inference(variable_rename,[status(thm)],[succ_plus_3_r]) ).
cnf(c_0_23,plain,
plus(X1,n2) = succ(succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_27,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
fof(c_0_28,plain,
! [X202,X203] :
( ( n0 != X203
| n4 != X202
| ~ epred2_2(X203,X202) )
& ( n0 != X203
| n5 != X202
| ~ epred2_2(X203,X202) )
& ( n1 != X203
| n4 != X202
| ~ epred2_2(X203,X202) )
& ( n1 != X203
| n5 != X202
| ~ epred2_2(X203,X202) )
& ( n2 != X202
| n5 != X203
| ~ epred2_2(X203,X202) )
& ( n2 != X203
| n4 != X202
| ~ epred2_2(X203,X202) )
& ( n2 != X203
| n5 != X202
| ~ epred2_2(X203,X202) )
& ( n3 != X202
| n4 != X203
| ~ epred2_2(X203,X202) )
& ( n3 != X202
| n5 != X203
| ~ epred2_2(X203,X202) )
& ( n3 != X203
| n4 != X202
| ~ epred2_2(X203,X202) )
& ( n3 != X203
| n5 != X202
| ~ epred2_2(X203,X202) )
& ( n4 != X202
| n4 != X203
| ~ epred2_2(X203,X202) )
& ( n4 != X202
| n5 != X203
| ~ epred2_2(X203,X202) )
& ( n4 != X203
| n5 != X202
| ~ epred2_2(X203,X202) )
& ( n5 != X202
| n5 != X203
| ~ epred2_2(X203,X202) )
& ( n1 = X202
| ~ epred2_2(X203,X202) )
& ( n3 = X202
| ~ epred2_2(X203,X202) )
& ( n3 = X203
| ~ epred2_2(X203,X202) )
& ( n5 = X203
| ~ epred2_2(X203,X202) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
fof(c_0_29,negated_conjecture,
( leq(n0,esk24_0)
& leq(n0,esk25_0)
& leq(esk24_0,n5)
& leq(esk25_0,n5)
& epred2_2(esk25_0,esk24_0)
& times(divide(n1,n400),a_select2(sigma,n3)) != n0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
fof(c_0_30,plain,
! [X141] : plus(X141,n4) = succ(succ(succ(succ(X141)))),
inference(variable_rename,[status(thm)],[succ_plus_4_r]) ).
cnf(c_0_31,plain,
plus(X1,n3) = succ(succ(succ(X1))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
plus(X1,n2) = plus(plus(X1,n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_33,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_34,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_35,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24]),c_0_24]) ).
cnf(c_0_36,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_37,plain,
( n1 = X1
| ~ epred2_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
epred2_2(esk25_0,esk24_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_39,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_40,plain,
! [X150,X151] :
( ~ leq(succ(X150),X151)
| gt(X151,X150) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_41,plain,
! [X142] : plus(n4,X142) = succ(succ(succ(succ(X142)))),
inference(variable_rename,[status(thm)],[succ_plus_4_l]) ).
cnf(c_0_42,plain,
plus(X1,n4) = succ(succ(succ(succ(X1)))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
plus(X1,n3) = plus(plus(plus(X1,n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_44,plain,
plus(n1,plus(X1,n1)) = plus(X1,n2),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_45,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_46,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_47,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_48,negated_conjecture,
esk24_0 = n1,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_49,plain,
! [X33] : ~ gt(X33,X33),
inference(variable_rename,[status(thm)],[c_0_39]) ).
cnf(c_0_50,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_51,plain,
plus(n4,X1) = succ(succ(succ(succ(X1)))),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
plus(X1,n4) = plus(plus(plus(plus(X1,n1),n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_24]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_53,plain,
plus(n1,plus(X1,n2)) = plus(X1,n3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_33]),c_0_44]),c_0_33]) ).
cnf(c_0_54,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_55,plain,
plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_24]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_56,plain,
plus(n2,n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_36]),c_0_47]) ).
cnf(c_0_57,plain,
( n3 = X1
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_58,negated_conjecture,
epred2_2(esk25_0,n1),
inference(rw,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_59,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_60,plain,
( gt(X2,X1)
| ~ leq(plus(X1,n1),X2) ),
inference(rw,[status(thm)],[c_0_50,c_0_24]) ).
cnf(c_0_61,plain,
plus(n4,X1) = plus(plus(plus(plus(X1,n1),n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_24]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_62,plain,
plus(n1,plus(X1,n3)) = plus(X1,n4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_33]),c_0_44]),c_0_33]),c_0_53]),c_0_33]) ).
cnf(c_0_63,plain,
plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_64,plain,
plus(n3,n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_36]),c_0_47]),c_0_56]) ).
fof(c_0_65,plain,
! [X42,X43] :
( ~ gt(X43,X42)
| leq(X42,X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).
cnf(c_0_66,plain,
esk25_0 = n3,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,plain,
plus(X1,n4) = plus(n4,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_33]),c_0_44]),c_0_33]),c_0_53]),c_0_33]),c_0_62]) ).
cnf(c_0_69,plain,
plus(n1,plus(n1,plus(n1,n2))) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_36]),c_0_47]),c_0_33]),c_0_33]),c_0_33]) ).
cnf(c_0_70,plain,
plus(n1,n3) = n4,
inference(rw,[status(thm)],[c_0_64,c_0_33]) ).
cnf(c_0_71,plain,
( leq(X2,X1)
| ~ gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_72,plain,
gt(n4,n3),
inference(split_conjunct,[status(thm)],[gt_4_3]) ).
cnf(c_0_73,plain,
( n5 = X1
| ~ epred2_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_74,negated_conjecture,
epred2_2(n3,n1),
inference(rw,[status(thm)],[c_0_58,c_0_66]) ).
cnf(c_0_75,plain,
~ leq(plus(n1,n4),n4),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,plain,
plus(n1,n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_53]),c_0_70]) ).
cnf(c_0_77,plain,
leq(n3,n4),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,plain,
n3 = n5,
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_79,plain,
~ leq(n5,n4),
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n031.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 : Tue Aug 29 05:05:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.72 % Version : CSE_E---1.5
% 0.20/0.72 % Problem : theBenchmark.p
% 0.20/0.72 % Proof found
% 0.20/0.72 % SZS status Theorem for theBenchmark.p
% 0.20/0.72 % SZS output start Proof
% See solution above
% 0.20/0.73 % Total time : 0.152000 s
% 0.20/0.73 % SZS output end Proof
% 0.20/0.73 % Total time : 0.157000 s
%------------------------------------------------------------------------------