%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV089+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:00:32 PM UTC 2026
% Result : Theorem 47.98s 7.44s
% Output : CNFRefutation 47.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of formulae : 106 ( 71 unt; 0 def)
% Number of atoms : 206 ( 171 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 152 ( 52 ~; 75 |; 17 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-4 aty)
% Number of variables : 140 ( 9 sgn 77 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0001,conjecture,
( true
=> ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) = use ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_inuse_0001) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(sel3_update_1,axiom,
! [X1,X7,X24,X17] : a_select3(tptp_update3(X1,X7,X24,X17),X7,X24) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel3_update_1) ).
fof(sel3_update_2,axiom,
! [X5,X11,X7,X24,X1,X17,X25] :
( ( a_select3(X1,X7,X24) = X17
& X11 = X24
& X5 != X7 )
=> a_select3(tptp_update3(X1,X5,X11,X25),X7,X24) = X17 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel3_update_2) ).
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(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(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_3_l,axiom,
! [X1] : plus(n3,X1) = succ(succ(succ(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_3_l) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_3) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(gt_5_4,axiom,
gt(n5,n4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_4) ).
fof(gt_4_3,axiom,
gt(n4,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_3) ).
fof(gt_2_0,axiom,
gt(n2,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_2_0) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c_0_23,negated_conjecture,
~ ( true
=> ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) = use
& a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0001]) ).
fof(c_0_24,plain,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
inference(fof_simplification,[status(thm)],[sel2_update_2]) ).
fof(c_0_25,negated_conjecture,
( ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) != use )
& true ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
fof(c_0_26,plain,
! [X173,X174,X175] : a_select2(tptp_update2(X173,X174,X175),X174) = X175,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_27,plain,
! [X154,X155,X156,X157] : a_select3(tptp_update3(X154,X155,X156,X157),X155,X156) = X157,
inference(variable_rename,[status(thm)],[sel3_update_1]) ).
fof(c_0_28,plain,
! [X176,X177,X178,X179,X180] :
( a_select2(tptp_update2(X178,X176,X180),X177) = X179
| a_select2(X178,X177) != X179
| X176 = X177 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_29,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n3) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n0,n0) != use ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
a_select3(tptp_update3(X1,X2,X3,X4),X2,X3) = X4,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( a_select2(X3,X2) != X4
| a_select2(tptp_update2(X3,X1,X5),X2) = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X5,X11,X7,X24,X1,X17,X25] :
( ( a_select3(X1,X7,X24) = X17
& X11 = X24
& X5 != X7 )
=> a_select3(tptp_update3(X1,X5,X11,X25),X7,X24) = X17 ),
inference(fof_simplification,[status(thm)],[sel3_update_2]) ).
cnf(c_0_34,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),c_0_31])]) ).
cnf(c_0_35,plain,
( X2 = X4
| a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4) ),
inference(er,[status(thm)],[c_0_32]) ).
fof(c_0_36,plain,
! [X158,X159,X160,X161,X162,X163,X164] :
( a_select3(tptp_update3(X162,X158,X159,X164),X160,X161) = X163
| a_select3(X162,X160,X161) != X163
| X159 != X161
| X158 = X160 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).
cnf(c_0_37,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n3,use),n4) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| n5 = n3 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( a_select3(X5,X2,X4) != X6
| X3 != X4
| a_select3(tptp_update3(X5,X1,X3,X7),X2,X4) = X6
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n5,use),n4,use),n5,use),n3,use),n4,use),n5) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| n5 = n3
| n4 = n3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_30])]) ).
cnf(c_0_40,plain,
( X4 = X2
| a_select2(tptp_update2(tptp_update2(X1,X2,X3),X4,X5),X2) = X3 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30])]) ).
cnf(c_0_41,plain,
( a_select3(X1,X5,X3) != X6
| X2 = X5
| a_select3(tptp_update3(X1,X2,X3,X4),X5,X3) = X6 ),
inference(er,[status(thm)],[c_0_38]) ).
fof(c_0_42,plain,
! [X137] : plus(X137,n2) = succ(succ(X137)),
inference(variable_rename,[status(thm)],[succ_plus_2_r]) ).
fof(c_0_43,plain,
! [X135] : plus(X135,n1) = succ(X135),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_44,plain,
! [X136] : plus(n1,X136) = succ(X136),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
cnf(c_0_45,negated_conjecture,
( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n1,n0) != use
| n4 = n3
| n5 = n3
| n5 = n4 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_40]) ).
cnf(c_0_46,plain,
( X2 = X5
| a_select3(tptp_update3(X1,X2,X3,X4),X5,X3) = a_select3(X1,X5,X3) ),
inference(er,[status(thm)],[c_0_41]) ).
fof(c_0_47,plain,
! [X139] : plus(X139,n3) = succ(succ(succ(X139))),
inference(variable_rename,[status(thm)],[succ_plus_3_r]) ).
cnf(c_0_48,plain,
plus(X1,n2) = succ(succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_52,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_53,negated_conjecture,
( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n0,n0,use),n2,n0) != use
| n5 = n4
| n5 = n3
| n4 = n3
| n1 = n0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31])]) ).
fof(c_0_54,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_55,plain,
! [X150,X151] :
( gt(X151,X150)
| ~ leq(succ(X150),X151) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])])]) ).
fof(c_0_56,plain,
! [X140] : plus(n3,X140) = succ(succ(succ(X140))),
inference(variable_rename,[status(thm)],[succ_plus_3_l]) ).
cnf(c_0_57,plain,
plus(X1,n3) = succ(succ(succ(X1))),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_58,plain,
plus(X1,n2) = plus(plus(X1,n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_49]) ).
cnf(c_0_59,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_60,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_61,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_49]) ).
cnf(c_0_62,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_52,c_0_49]) ).
cnf(c_0_63,negated_conjecture,
( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n1,n0,use),n2,n0) != use
| n1 = n0
| n4 = n3
| n5 = n3
| n5 = n4
| n2 = n0 ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
fof(c_0_64,plain,
! [X33] : ~ gt(X33,X33),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_54])]) ).
cnf(c_0_65,plain,
( ~ leq(succ(X1),X2)
| gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_66,plain,
plus(n3,X1) = succ(succ(succ(X1))),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_67,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_57,c_0_49]),c_0_49]),c_0_49]) ).
cnf(c_0_68,plain,
plus(n1,plus(X1,n1)) = plus(X1,n2),
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_69,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_70,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_49]),c_0_49]),c_0_49]) ).
cnf(c_0_71,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
fof(c_0_72,plain,
! [X42,X43] :
( leq(X42,X43)
| ~ gt(X43,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])])]) ).
cnf(c_0_73,negated_conjecture,
( a_select3(tptp_update3(tptp_update3(tptp_update3(tptp_update3(u_defuse,n2,n0,use),n1,n0,use),n2,n0,use),n0,n0,use),n2,n0) != use
| n2 = n0
| n5 = n4
| n5 = n3
| n4 = n3
| n1 = n0
| n2 = n1 ),
inference(spm,[status(thm)],[c_0_63,c_0_46]) ).
cnf(c_0_74,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_75,plain,
( ~ leq(plus(X1,n1),X2)
| gt(X2,X1) ),
inference(rw,[status(thm)],[c_0_65,c_0_49]) ).
cnf(c_0_76,plain,
plus(n3,X1) = plus(plus(plus(X1,n1),n1),n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_49]),c_0_49]),c_0_49]) ).
cnf(c_0_77,plain,
plus(n1,plus(X1,n2)) = plus(X1,n3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_59]),c_0_68]),c_0_59]) ).
cnf(c_0_78,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_69,c_0_49]),c_0_49]),c_0_49]),c_0_49]) ).
cnf(c_0_79,plain,
plus(n1,n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_62]),c_0_71]),c_0_59]) ).
fof(c_0_80,plain,
! [X146] : pred(succ(X146)) = X146,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_81,plain,
! [X145] : minus(X145,n1) = pred(X145),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_82,plain,
( ~ gt(X1,X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_83,plain,
gt(n5,n4),
inference(split_conjunct,[status(thm)],[gt_5_4]) ).
cnf(c_0_84,negated_conjecture,
( n2 = n1
| n1 = n0
| n4 = n3
| n5 = n3
| n5 = n4
| n2 = n0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_46]),c_0_31])]) ).
cnf(c_0_85,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_86,plain,
plus(X1,n3) = plus(n3,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_59]),c_0_68]),c_0_59]),c_0_77]) ).
cnf(c_0_87,plain,
plus(n1,n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_62]),c_0_71]),c_0_59]),c_0_79]),c_0_59]) ).
cnf(c_0_88,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_89,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_90,plain,
leq(n4,n5),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_91,negated_conjecture,
( n2 = n0
| n5 = n3
| n4 = n3
| n1 = n0
| n2 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_74]) ).
cnf(c_0_92,plain,
~ leq(n4,n3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_93,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_49]),c_0_89]) ).
cnf(c_0_94,plain,
gt(n4,n3),
inference(split_conjunct,[status(thm)],[gt_4_3]) ).
cnf(c_0_95,negated_conjecture,
( n2 = n1
| n1 = n0
| n4 = n3
| n2 = n0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
cnf(c_0_96,plain,
minus(n2,n1) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_59]),c_0_71]) ).
cnf(c_0_97,negated_conjecture,
( n2 = n0
| n1 = n0
| n2 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_74]) ).
cnf(c_0_98,plain,
minus(n1,n1) = n0,
inference(spm,[status(thm)],[c_0_93,c_0_62]) ).
cnf(c_0_99,plain,
gt(n2,n0),
inference(split_conjunct,[status(thm)],[gt_2_0]) ).
cnf(c_0_100,negated_conjecture,
( n1 = n0
| n2 = n0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98])]) ).
fof(c_0_101,plain,
! [X34] : leq(X34,X34),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_102,plain,
~ leq(n1,n0),
inference(spm,[status(thm)],[c_0_85,c_0_62]) ).
cnf(c_0_103,negated_conjecture,
n1 = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_74]) ).
cnf(c_0_104,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_105,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103]),c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV089+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.35 % Computer : n001.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8046.5625MB
% 0.12/0.35 % OS : Linux 6.8.0-71-generic
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Sep 21 08:35:44 UTC 2026
% 0.12/0.35 % CPUTime :
% 0.12/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 47.98/7.44 % Version: 3.5.1
% 47.98/7.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 47.98/7.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.98/7.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 47.98/7.44 % Starting new_bool_3 with 300s (1) cores
% 47.98/7.44 % Starting new_bool_1 with 300s (1) cores
% 47.98/7.44 % Starting sh5l with 300s (1) cores
% 47.98/7.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2689715 completed with status 0
% 47.98/7.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 47.98/7.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 47.98/7.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.98/7.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 47.98/7.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 47.98/7.44 % No SInE strategy applied
% 47.98/7.44 % Search class: FGHSM-FSLM33-DFFFFFNN
% 47.98/7.44 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 47.98/7.44 % Starting SubtermCWHack with 136s (1) cores
% 47.98/7.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 47.98/7.44 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 47.98/7.44 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 47.98/7.44 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 47.98/7.44 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2689725 completed with status 0
% 47.98/7.44 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 47.98/7.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 47.98/7.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.98/7.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 47.98/7.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 47.98/7.44 % No SInE strategy applied
% 47.98/7.44 % Search class: FGHSM-FSLM33-DFFFFFNN
% 47.98/7.44 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 47.98/7.44 % Starting SubtermCWHack with 136s (1) cores
% 47.98/7.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 47.98/7.44 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 47.98/7.44 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 47.98/7.44 % Preprocessing time : 0.126 s
% 47.98/7.44
% 47.98/7.44 % Proof found!
% 47.98/7.44 % SZS status Theorem
% 47.98/7.44 % SZS output start CNFRefutation
% See solution above
% 47.98/7.44 % Parsed axioms : 85
% 47.98/7.44 % Removed by relevancy pruning/SinE : 0
% 47.98/7.44 % Initial clauses : 194
% 47.98/7.44 % Removed in clause preprocessing : 2
% 47.98/7.44 % Initial clauses in saturation : 192
% 47.98/7.44 % Processed clauses : 5775
% 47.98/7.44 % ...of these trivial : 300
% 47.98/7.44 % ...subsumed : 3293
% 47.98/7.44 % ...remaining for further processing : 2182
% 47.98/7.44 % Other redundant clauses eliminated : 1770
% 47.98/7.44 % Clauses deleted for lack of memory : 0
% 47.98/7.44 % Backward-subsumed : 78
% 47.98/7.44 % Backward-rewritten : 389
% 47.98/7.44 % Generated clauses : 103156
% 47.98/7.44 % ...of the previous two non-redundant : 97634
% 47.98/7.44 % ...aggressively subsumed : 0
% 47.98/7.44 % Contextual simplify-reflections : 155
% 47.98/7.44 % Paramodulations : 100561
% 47.98/7.44 % Factorizations : 801
% 47.98/7.44 % NegExts : 0
% 47.98/7.44 % Equation resolutions : 1794
% 47.98/7.44 % Disequality decompositions : 0
% 47.98/7.44 % Total rewrite steps : 84973
% 47.98/7.44 % ...of those cached : 84489
% 47.98/7.44 % Propositional unsat checks : 0
% 47.98/7.44 % Propositional check models : 0
% 47.98/7.44 % Propositional check unsatisfiable : 0
% 47.98/7.44 % Propositional clauses : 0
% 47.98/7.44 % Propositional clauses after purity: 0
% 47.98/7.44 % Propositional unsat core size : 0
% 47.98/7.44 % Propositional preprocessing time : 0.000
% 47.98/7.44 % Propositional encoding time : 0.000
% 47.98/7.44 % Propositional solver time : 0.000
% 47.98/7.44 % Success case prop preproc time : 0.000
% 47.98/7.44 % Success case prop encoding time : 0.000
% 47.98/7.44 % Success case prop solver time : 0.000
% 47.98/7.44 % Current number of processed clauses : 1714
% 47.98/7.44 % Positive orientable unit clauses : 237
% 47.98/7.44 % Positive unorientable unit clauses: 4
% 47.98/7.44 % Negative unit clauses : 222
% 47.98/7.44 % Non-unit-clauses : 1251
% 47.98/7.44 % Current number of unprocessed clauses: 91672
% 47.98/7.44 % ...number of literals in the above : 698596
% 47.98/7.44 % Current number of archived formulas : 0
% 47.98/7.44 % Current number of archived clauses : 469
% 47.98/7.44 % Clause-clause subsumption calls (NU) : 785954
% 47.98/7.44 % Rec. Clause-clause subsumption calls : 27165
% 47.98/7.44 % Non-unit clause-clause subsumptions : 1069
% 47.98/7.44 % Unit Clause-clause subsumption calls : 89159
% 47.98/7.44 % Rewrite failures with RHS unbound : 0
% 47.98/7.44 % BW rewrite match attempts : 224
% 47.98/7.44 % BW rewrite match successes : 65
% 47.98/7.44 % Condensation attempts : 0
% 47.98/7.44 % Condensation successes : 0
% 47.98/7.44 % Termbank termtop insertions : 3164618
% 47.98/7.44 % Search garbage collected termcells : 2178
% 47.98/7.44
% 47.98/7.44 % -------------------------------------------------
% 47.98/7.44 % User time : 6.653 s
% 47.98/7.44 % System time : 0.193 s
% 47.98/7.44 % Total time : 6.846 s
% 47.98/7.44 % Maximum resident set size: 4252 pages
% 47.98/7.44
% 47.98/7.44 % -------------------------------------------------
% 47.98/7.44 % User time : 32.889 s
% 47.98/7.44 % System time : 0.977 s
% 47.98/7.44 % Total time : 33.867 s
% 47.98/7.44 % Maximum resident set size: 4864 pages
% 47.98/7.44 % E exiting
%------------------------------------------------------------------------------