↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV103+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 : n015.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 02:53:43 PM UTC 2026

% Result   : Theorem 0.30s 1.03s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   35
%            Number of leaves      :   31
% Syntax   : Number of formulae    :  148 (  98 unt;   0 def)
%            Number of atoms       :  470 ( 412 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  414 (  92   ~; 275   |;  40   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  10 con; 0-3 aty)
%            Number of variables   :   98 (   3 sgn  54   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0015,conjecture,
    ( ( a_select2(xinit_defuse,n5) = use
      & a_select2(xinit_defuse,n4) = use
      & a_select2(xinit_defuse,n3) = use
      & a_select3(u_defuse,n2,n0) = use
      & a_select3(u_defuse,n1,n0) = use
      & a_select3(u_defuse,n0,n0) = use )
   => ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n5) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n4) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) = use
      & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) = use
      & a_select2(xinit_defuse,n5) = use
      & a_select2(xinit_defuse,n4) = use
      & a_select2(xinit_defuse,n3) = use
      & a_select3(u_defuse,n2,n0) = use
      & a_select3(u_defuse,n1,n0) = use
      & a_select3(u_defuse,n0,n0) = use ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_inuse_0015) ).

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(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(succ_plus_2_l,axiom,
    ! [X1] : plus(n2,X1) = succ(succ(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_2_l) ).

fof(successor_4,axiom,
    succ(succ(succ(succ(n0)))) = n4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).

fof(leq_succ,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
     => leq(X1,succ(X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ) ).

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_5_4,axiom,
    gt(n5,n4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_4) ).

fof(gt_5_1,axiom,
    gt(n5,n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_1) ).

fof(gt_5_0,axiom,
    gt(n5,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_0) ).

fof(gt_4_3,axiom,
    gt(n4,n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_3) ).

fof(gt_4_2,axiom,
    gt(n4,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_2) ).

fof(gt_4_1,axiom,
    gt(n4,n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_1) ).

fof(gt_4_0,axiom,
    gt(n4,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_4_0) ).

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_3_2,axiom,
    gt(n3,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_3_2) ).

fof(gt_3_1,axiom,
    gt(n3,n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_3_1) ).

fof(gt_3_0,axiom,
    gt(n3,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_3_0) ).

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_31,negated_conjecture,
    ~ ( ( a_select2(xinit_defuse,n5) = use
        & a_select2(xinit_defuse,n4) = use
        & a_select2(xinit_defuse,n3) = use
        & a_select3(u_defuse,n2,n0) = use
        & a_select3(u_defuse,n1,n0) = use
        & a_select3(u_defuse,n0,n0) = use )
     => ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n5) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n4) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) = use
        & a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) = use
        & a_select2(xinit_defuse,n5) = use
        & a_select2(xinit_defuse,n4) = use
        & a_select2(xinit_defuse,n3) = use
        & a_select3(u_defuse,n2,n0) = use
        & a_select3(u_defuse,n1,n0) = use
        & a_select3(u_defuse,n0,n0) = use ) ),
    inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0015]) ).

fof(c_0_32,negated_conjecture,
    ( ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n5) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n4) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
      | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use
      | a_select2(xinit_defuse,n5) != use
      | a_select2(xinit_defuse,n4) != use
      | a_select2(xinit_defuse,n3) != use
      | a_select3(u_defuse,n2,n0) != use
      | a_select3(u_defuse,n1,n0) != use
      | a_select3(u_defuse,n0,n0) != use )
    & a_select2(xinit_defuse,n5) = use
    & a_select2(xinit_defuse,n4) = use
    & a_select2(xinit_defuse,n3) = use
    & a_select3(u_defuse,n2,n0) = use
    & a_select3(u_defuse,n1,n0) = use
    & a_select3(u_defuse,n0,n0) = use ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])]) ).

fof(c_0_33,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]) ).

cnf(c_0_34,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n5) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n4) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use
    | a_select2(xinit_defuse,n5) != use
    | a_select2(xinit_defuse,n4) != use
    | a_select2(xinit_defuse,n3) != use
    | a_select3(u_defuse,n2,n0) != use
    | a_select3(u_defuse,n1,n0) != use
    | a_select3(u_defuse,n0,n0) != use ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    a_select2(xinit_defuse,n3) = use,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    a_select2(xinit_defuse,n4) = use,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    a_select2(xinit_defuse,n5) = use,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    a_select3(u_defuse,n0,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_39,negated_conjecture,
    a_select3(u_defuse,n1,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

fof(c_0_40,plain,
    ! [X173,X174,X175] : a_select2(tptp_update2(X173,X174,X175),X174) = X175,
    inference(variable_rename,[status(thm)],[sel2_update_1]) ).

fof(c_0_41,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_33])])]) ).

cnf(c_0_42,negated_conjecture,
    ( a_select3(u_defuse,n2,n0) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n5) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n4) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]),c_0_38]),c_0_39])]) ).

cnf(c_0_43,negated_conjecture,
    a_select3(u_defuse,n2,n0) = use,
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_44,plain,
    a_select2(tptp_update2(X1,X2,X3),X2) = X3,
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_45,plain,
    ( a_select2(X3,X2) != X4
    | a_select2(tptp_update2(X3,X1,X5),X2) = X4
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n4) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),c_0_44])]) ).

cnf(c_0_47,plain,
    ( X2 = X4
    | a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4) ),
    inference(er,[status(thm)],[c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n3) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use
    | n5 = n4 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44])]) ).

cnf(c_0_49,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n3) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use
    | n5 = n4
    | n5 = n3 ),
    inference(spm,[status(thm)],[c_0_48,c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n0) != use
    | n5 = n3
    | n5 = n4
    | n4 = n3 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_47]),c_0_44])]) ).

cnf(c_0_51,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n0) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | n4 = n3
    | n5 = n4
    | n5 = n3
    | n5 = n0 ),
    inference(spm,[status(thm)],[c_0_50,c_0_47]) ).

cnf(c_0_52,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n0) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | n5 = n0
    | n5 = n3
    | n5 = n4
    | n4 = n3
    | n4 = n0 ),
    inference(spm,[status(thm)],[c_0_51,c_0_47]) ).

cnf(c_0_53,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n0) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | n4 = n0
    | n4 = n3
    | n5 = n4
    | n5 = n3
    | n5 = n0
    | n3 = n0 ),
    inference(spm,[status(thm)],[c_0_52,c_0_47]) ).

cnf(c_0_54,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n0) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | n3 = n0
    | n5 = n0
    | n5 = n3
    | n5 = n4
    | n4 = n3
    | n4 = n0
    | n2 = n0 ),
    inference(spm,[status(thm)],[c_0_53,c_0_47]) ).

cnf(c_0_55,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n1) != use
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n5 = n4
    | n5 = n3
    | n5 = n0
    | n3 = n0
    | n1 = n0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_47]),c_0_44])]) ).

cnf(c_0_56,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | n1 = n0
    | n3 = n0
    | n5 = n0
    | n5 = n3
    | n5 = n4
    | n4 = n3
    | n4 = n0
    | n2 = n0
    | n5 = n1 ),
    inference(spm,[status(thm)],[c_0_55,c_0_47]) ).

cnf(c_0_57,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | n5 = n1
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n5 = n4
    | n5 = n3
    | n5 = n0
    | n3 = n0
    | n1 = n0
    | n4 = n1 ),
    inference(spm,[status(thm)],[c_0_56,c_0_47]) ).

fof(c_0_58,plain,
    ! [X137] : plus(X137,n2) = succ(succ(X137)),
    inference(variable_rename,[status(thm)],[succ_plus_2_r]) ).

fof(c_0_59,plain,
    ! [X135] : plus(X135,n1) = succ(X135),
    inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).

fof(c_0_60,plain,
    ! [X136] : plus(n1,X136) = succ(X136),
    inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).

cnf(c_0_61,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n1) != use
    | a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | n4 = n1
    | n1 = n0
    | n3 = n0
    | n5 = n0
    | n5 = n3
    | n5 = n4
    | n4 = n3
    | n4 = n0
    | n2 = n0
    | n5 = n1
    | n3 = n1 ),
    inference(spm,[status(thm)],[c_0_57,c_0_47]) ).

fof(c_0_62,plain,
    ! [X139] : plus(X139,n3) = succ(succ(succ(X139))),
    inference(variable_rename,[status(thm)],[succ_plus_3_r]) ).

cnf(c_0_63,plain,
    plus(X1,n2) = succ(succ(X1)),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_64,plain,
    plus(X1,n1) = succ(X1),
    inference(split_conjunct,[status(thm)],[c_0_59]) ).

cnf(c_0_65,plain,
    plus(n1,X1) = succ(X1),
    inference(split_conjunct,[status(thm)],[c_0_60]) ).

cnf(c_0_66,plain,
    succ(succ(n0)) = n2,
    inference(split_conjunct,[status(thm)],[successor_2]) ).

cnf(c_0_67,plain,
    succ(n0) = n1,
    inference(split_conjunct,[status(thm)],[successor_1]) ).

cnf(c_0_68,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n5,use),n2) != use
    | n3 = n1
    | n5 = n1
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n5 = n4
    | n5 = n3
    | n5 = n0
    | n3 = n0
    | n1 = n0
    | n4 = n1
    | n2 = n1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_47]),c_0_44])]) ).

fof(c_0_69,plain,
    ! [X1] : ~ gt(X1,X1),
    inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).

fof(c_0_70,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_71,plain,
    ! [X140] : plus(n3,X140) = succ(succ(succ(X140))),
    inference(variable_rename,[status(thm)],[succ_plus_3_l]) ).

cnf(c_0_72,plain,
    plus(X1,n3) = succ(succ(succ(X1))),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

cnf(c_0_73,plain,
    plus(X1,n2) = plus(plus(X1,n1),n1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_64]) ).

cnf(c_0_74,plain,
    plus(n1,X1) = plus(X1,n1),
    inference(rw,[status(thm)],[c_0_65,c_0_64]) ).

cnf(c_0_75,plain,
    succ(succ(succ(n0))) = n3,
    inference(split_conjunct,[status(thm)],[successor_3]) ).

cnf(c_0_76,plain,
    plus(plus(n0,n1),n1) = n2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_64]),c_0_64]) ).

cnf(c_0_77,plain,
    plus(n0,n1) = n1,
    inference(rw,[status(thm)],[c_0_67,c_0_64]) ).

fof(c_0_78,plain,
    ! [X138] : plus(n2,X138) = succ(succ(X138)),
    inference(variable_rename,[status(thm)],[succ_plus_2_l]) ).

cnf(c_0_79,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n4,use),n2) != use
    | n2 = n1
    | n4 = n1
    | n1 = n0
    | n3 = n0
    | n5 = n0
    | n5 = n3
    | n5 = n4
    | n4 = n3
    | n4 = n0
    | n2 = n0
    | n5 = n1
    | n3 = n1
    | n5 = n2 ),
    inference(spm,[status(thm)],[c_0_68,c_0_47]) ).

fof(c_0_80,plain,
    ! [X33] : ~ gt(X33,X33),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_69])]) ).

cnf(c_0_81,plain,
    ( ~ leq(succ(X1),X2)
    | gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_70]) ).

cnf(c_0_82,plain,
    plus(n3,X1) = succ(succ(succ(X1))),
    inference(split_conjunct,[status(thm)],[c_0_71]) ).

cnf(c_0_83,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_72,c_0_64]),c_0_64]),c_0_64]) ).

cnf(c_0_84,plain,
    plus(n1,plus(X1,n1)) = plus(X1,n2),
    inference(rw,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_85,plain,
    succ(succ(succ(succ(n0)))) = n4,
    inference(split_conjunct,[status(thm)],[successor_4]) ).

cnf(c_0_86,plain,
    plus(plus(plus(n0,n1),n1),n1) = n3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_64]),c_0_64]),c_0_64]) ).

cnf(c_0_87,plain,
    plus(n1,n1) = n2,
    inference(rw,[status(thm)],[c_0_76,c_0_77]) ).

fof(c_0_88,plain,
    ! [X49,X50] :
      ( leq(X49,succ(X50))
      | ~ leq(X49,X50) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])])]) ).

cnf(c_0_89,plain,
    plus(n2,X1) = succ(succ(X1)),
    inference(split_conjunct,[status(thm)],[c_0_78]) ).

fof(c_0_90,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_91,negated_conjecture,
    ( a_select2(tptp_update2(tptp_update2(tptp_update2(tptp_update2(sigma_defuse,n0,use),n1,use),n2,use),n3,use),n2) != use
    | n5 = n2
    | n3 = n1
    | n5 = n1
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n5 = n4
    | n5 = n3
    | n5 = n0
    | n3 = n0
    | n1 = n0
    | n4 = n1
    | n2 = n1
    | n4 = n2 ),
    inference(spm,[status(thm)],[c_0_79,c_0_47]) ).

cnf(c_0_92,plain,
    ~ gt(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_80]) ).

cnf(c_0_93,plain,
    ( ~ leq(plus(X1,n1),X2)
    | gt(X2,X1) ),
    inference(rw,[status(thm)],[c_0_81,c_0_64]) ).

cnf(c_0_94,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_82,c_0_64]),c_0_64]),c_0_64]) ).

cnf(c_0_95,plain,
    plus(n1,plus(X1,n2)) = plus(X1,n3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_74]),c_0_84]),c_0_74]) ).

cnf(c_0_96,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_85,c_0_64]),c_0_64]),c_0_64]),c_0_64]) ).

cnf(c_0_97,plain,
    plus(n1,n2) = n3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_77]),c_0_87]),c_0_74]) ).

cnf(c_0_98,plain,
    ( ~ leq(X1,X2)
    | leq(X1,succ(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_88]) ).

cnf(c_0_99,plain,
    plus(n2,X1) = plus(plus(X1,n1),n1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_64]),c_0_64]) ).

cnf(c_0_100,plain,
    ( ~ gt(X1,X2)
    | leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_90]) ).

cnf(c_0_101,plain,
    gt(n5,n4),
    inference(split_conjunct,[status(thm)],[gt_5_4]) ).

cnf(c_0_102,negated_conjecture,
    ( n4 = n2
    | n2 = n1
    | n4 = n1
    | n1 = n0
    | n3 = n0
    | n5 = n0
    | n5 = n3
    | n5 = n4
    | n4 = n3
    | n4 = n0
    | n2 = n0
    | n5 = n1
    | n3 = n1
    | n5 = n2
    | n3 = n2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_47]),c_0_44])]) ).

cnf(c_0_103,plain,
    ~ leq(plus(X1,n1),X1),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_104,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_94,c_0_74]),c_0_84]),c_0_74]),c_0_95]) ).

cnf(c_0_105,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_96,c_0_77]),c_0_87]),c_0_74]),c_0_97]),c_0_74]) ).

cnf(c_0_106,plain,
    ( ~ leq(X1,X2)
    | leq(X1,plus(X2,n1)) ),
    inference(rw,[status(thm)],[c_0_98,c_0_64]) ).

cnf(c_0_107,plain,
    plus(X1,n2) = plus(n2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_74]),c_0_84]) ).

cnf(c_0_108,plain,
    leq(n4,n5),
    inference(spm,[status(thm)],[c_0_100,c_0_101]) ).

cnf(c_0_109,negated_conjecture,
    ( n3 = n2
    | n5 = n2
    | n3 = n1
    | n5 = n1
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n5 = n3
    | n5 = n0
    | n3 = n0
    | n1 = n0
    | n4 = n1
    | n2 = n1
    | n4 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_92]) ).

cnf(c_0_110,plain,
    ~ leq(n4,n3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]) ).

cnf(c_0_111,plain,
    ~ leq(plus(X1,n2),X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_106]),c_0_74]),c_0_84]) ).

cnf(c_0_112,plain,
    plus(n2,n2) = n4,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_107]),c_0_97]),c_0_105]) ).

cnf(c_0_113,negated_conjecture,
    ( n4 = n2
    | n2 = n1
    | n4 = n1
    | n1 = n0
    | n3 = n0
    | n5 = n0
    | n4 = n3
    | n4 = n0
    | n2 = n0
    | n5 = n1
    | n3 = n1
    | n5 = n2
    | n3 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]) ).

cnf(c_0_114,plain,
    ~ leq(n4,n2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_107]),c_0_112]) ).

cnf(c_0_115,plain,
    gt(n5,n1),
    inference(split_conjunct,[status(thm)],[gt_5_1]) ).

cnf(c_0_116,negated_conjecture,
    ( n3 = n2
    | n3 = n1
    | n5 = n1
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n5 = n0
    | n3 = n0
    | n1 = n0
    | n4 = n1
    | n2 = n1
    | n4 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_113]),c_0_114]) ).

cnf(c_0_117,plain,
    gt(n5,n0),
    inference(split_conjunct,[status(thm)],[gt_5_0]) ).

cnf(c_0_118,negated_conjecture,
    ( n4 = n2
    | n2 = n1
    | n4 = n1
    | n1 = n0
    | n3 = n0
    | n5 = n0
    | n4 = n3
    | n4 = n0
    | n2 = n0
    | n3 = n1
    | n3 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_92]) ).

cnf(c_0_119,plain,
    gt(n4,n3),
    inference(split_conjunct,[status(thm)],[gt_4_3]) ).

cnf(c_0_120,negated_conjecture,
    ( n3 = n2
    | n3 = n1
    | n2 = n0
    | n4 = n0
    | n4 = n3
    | n3 = n0
    | n1 = n0
    | n4 = n1
    | n2 = n1
    | n4 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_92]) ).

cnf(c_0_121,plain,
    gt(n4,n2),
    inference(split_conjunct,[status(thm)],[gt_4_2]) ).

cnf(c_0_122,negated_conjecture,
    ( n4 = n2
    | n2 = n1
    | n4 = n1
    | n1 = n0
    | n3 = n0
    | n4 = n0
    | n2 = n0
    | n3 = n1
    | n3 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_92]) ).

cnf(c_0_123,plain,
    gt(n4,n1),
    inference(split_conjunct,[status(thm)],[gt_4_1]) ).

cnf(c_0_124,negated_conjecture,
    ( n3 = n2
    | n3 = n1
    | n2 = n0
    | n4 = n0
    | n3 = n0
    | n1 = n0
    | n4 = n1
    | n2 = n1 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_92]) ).

cnf(c_0_125,plain,
    gt(n4,n0),
    inference(split_conjunct,[status(thm)],[gt_4_0]) ).

cnf(c_0_126,negated_conjecture,
    ( n2 = n1
    | n1 = n0
    | n3 = n0
    | n4 = n0
    | n2 = n0
    | n3 = n1
    | n3 = n2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_92]) ).

fof(c_0_127,plain,
    ! [X146] : pred(succ(X146)) = X146,
    inference(variable_rename,[status(thm)],[pred_succ]) ).

fof(c_0_128,plain,
    ! [X145] : minus(X145,n1) = pred(X145),
    inference(variable_rename,[status(thm)],[pred_minus_1]) ).

cnf(c_0_129,plain,
    gt(n3,n2),
    inference(split_conjunct,[status(thm)],[gt_3_2]) ).

cnf(c_0_130,negated_conjecture,
    ( n3 = n2
    | n3 = n1
    | n2 = n0
    | n3 = n0
    | n1 = n0
    | n2 = n1 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_92]) ).

cnf(c_0_131,plain,
    pred(succ(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_127]) ).

cnf(c_0_132,plain,
    minus(X1,n1) = pred(X1),
    inference(split_conjunct,[status(thm)],[c_0_128]) ).

cnf(c_0_133,plain,
    gt(n3,n1),
    inference(split_conjunct,[status(thm)],[gt_3_1]) ).

cnf(c_0_134,negated_conjecture,
    ( n2 = n1
    | n1 = n0
    | n3 = n0
    | n2 = n0
    | n3 = n1 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_92]) ).

cnf(c_0_135,plain,
    minus(plus(X1,n1),n1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_64]),c_0_132]) ).

cnf(c_0_136,plain,
    gt(n3,n0),
    inference(split_conjunct,[status(thm)],[gt_3_0]) ).

cnf(c_0_137,negated_conjecture,
    ( n2 = n0
    | n3 = n0
    | n1 = n0
    | n2 = n1 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_92]) ).

cnf(c_0_138,plain,
    minus(n2,n1) = n1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_74]),c_0_87]) ).

cnf(c_0_139,negated_conjecture,
    ( n2 = n1
    | n1 = n0
    | n2 = n0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_92]) ).

cnf(c_0_140,plain,
    minus(n1,n1) = n0,
    inference(spm,[status(thm)],[c_0_135,c_0_77]) ).

cnf(c_0_141,plain,
    gt(n2,n0),
    inference(split_conjunct,[status(thm)],[gt_2_0]) ).

cnf(c_0_142,negated_conjecture,
    ( n1 = n0
    | n2 = n0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]) ).

fof(c_0_143,plain,
    ! [X34] : leq(X34,X34),
    inference(variable_rename,[status(thm)],[reflexivity_leq]) ).

cnf(c_0_144,plain,
    ~ leq(n1,n0),
    inference(spm,[status(thm)],[c_0_103,c_0_77]) ).

cnf(c_0_145,negated_conjecture,
    n1 = n0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_92]) ).

cnf(c_0_146,plain,
    leq(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_143]) ).

cnf(c_0_147,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_145]),c_0_146])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWV103+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.50  % Computer : n015.cluster.edu
% 0.20/0.50  % Model    : x86_64 x86_64
% 0.20/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.50  % Memory   : 8046.5625MB
% 0.20/0.50  % OS       : Linux 6.8.0-71-generic
% 0.20/0.50  % CPULimit : 300
% 0.20/0.50  % WCLimit  : 300
% 0.20/0.50  % DateTime : Mon Sep 21 08:34:21 UTC 2026
% 0.20/0.51  % CPUTime  : 
% 0.20/0.51  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.59  Running first-order theorem proving
% 0.24/0.59  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
% 0.30/1.03  % Version: 3.5.1
% 0.30/1.03  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/1.03  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/1.03  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/1.03  % Starting new_bool_3 with 300s (1) cores
% 0.30/1.03  % Starting new_bool_1 with 300s (1) cores
% 0.30/1.03  % Starting sh5l with 300s (1) cores
% 0.30/1.03  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1047974 completed with status 0
% 0.30/1.03  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.30/1.03  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/1.03  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/1.03  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/1.03  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/1.03  % No SInE strategy applied
% 0.30/1.03  % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.30/1.03  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/1.03  % Starting SubtermCWHack with 136s (1) cores
% 0.30/1.03  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.30/1.03  % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.30/1.03  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.30/1.03  % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.30/1.03  % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1047984 completed with status 0
% 0.30/1.03  % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.30/1.03  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/1.03  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/1.03  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/1.03  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/1.03  % No SInE strategy applied
% 0.30/1.03  % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.30/1.03  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/1.03  % Starting SubtermCWHack with 136s (1) cores
% 0.30/1.03  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.30/1.03  % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.30/1.03  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.30/1.03  % Preprocessing time       : 0.207 s
% 0.30/1.03  
% 0.30/1.03  % Proof found!
% 0.30/1.03  % SZS status Theorem
% 0.30/1.03  % SZS output start CNFRefutation
% See solution above
% 0.30/1.03  % Parsed axioms                        : 85
% 0.30/1.03  % Removed by relevancy pruning/SinE    : 0
% 0.30/1.03  % Initial clauses                      : 199
% 0.30/1.03  % Removed in clause preprocessing      : 2
% 0.30/1.03  % Initial clauses in saturation        : 197
% 0.30/1.03  % Processed clauses                    : 381
% 0.30/1.03  % ...of these trivial                  : 10
% 0.30/1.03  % ...subsumed                          : 51
% 0.30/1.03  % ...remaining for further processing  : 320
% 0.30/1.03  % Other redundant clauses eliminated   : 7
% 0.30/1.03  % Clauses deleted for lack of memory   : 0
% 0.30/1.03  % Backward-subsumed                    : 25
% 0.30/1.03  % Backward-rewritten                   : 65
% 0.30/1.03  % Generated clauses                    : 2463
% 0.30/1.03  % ...of the previous two non-redundant : 2146
% 0.30/1.03  % ...aggressively subsumed             : 0
% 0.30/1.03  % Contextual simplify-reflections      : 1
% 0.30/1.03  % Paramodulations                      : 2396
% 0.30/1.03  % Factorizations                       : 55
% 0.30/1.03  % NegExts                              : 0
% 0.30/1.03  % Equation resolutions                 : 12
% 0.30/1.03  % Disequality decompositions           : 0
% 0.30/1.03  % Total rewrite steps                  : 951
% 0.30/1.03  % ...of those cached                   : 821
% 0.30/1.03  % Propositional unsat checks           : 0
% 0.30/1.03  %    Propositional check models        : 0
% 0.30/1.03  %    Propositional check unsatisfiable : 0
% 0.30/1.03  %    Propositional clauses             : 0
% 0.30/1.03  %    Propositional clauses after purity: 0
% 0.30/1.03  %    Propositional unsat core size     : 0
% 0.30/1.03  %    Propositional preprocessing time  : 0.000
% 0.30/1.03  %    Propositional encoding time       : 0.000
% 0.30/1.03  %    Propositional solver time         : 0.000
% 0.30/1.03  %    Success case prop preproc time    : 0.000
% 0.30/1.03  %    Success case prop encoding time   : 0.000
% 0.30/1.03  %    Success case prop solver time     : 0.000
% 0.30/1.03  % Current number of processed clauses  : 229
% 0.30/1.03  %    Positive orientable unit clauses  : 52
% 0.30/1.03  %    Positive unorientable unit clauses: 4
% 0.30/1.03  %    Negative unit clauses             : 27
% 0.30/1.03  %    Non-unit-clauses                  : 146
% 0.30/1.03  % Current number of unprocessed clauses: 1820
% 0.30/1.03  % ...number of literals in the above   : 10921
% 0.30/1.03  % Current number of archived formulas  : 0
% 0.30/1.03  % Current number of archived clauses   : 92
% 0.30/1.03  % Clause-clause subsumption calls (NU) : 18582
% 0.30/1.03  % Rec. Clause-clause subsumption calls : 1360
% 0.30/1.03  % Non-unit clause-clause subsumptions  : 25
% 0.30/1.03  % Unit Clause-clause subsumption calls : 2332
% 0.30/1.03  % Rewrite failures with RHS unbound    : 0
% 0.30/1.03  % BW rewrite match attempts            : 19
% 0.30/1.03  % BW rewrite match successes           : 12
% 0.30/1.03  % Condensation attempts                : 0
% 0.30/1.03  % Condensation successes               : 0
% 0.30/1.03  % Termbank termtop insertions          : 65973
% 0.30/1.03  % Search garbage collected termcells   : 2215
% 0.30/1.03  
% 0.30/1.03  % -------------------------------------------------
% 0.30/1.03  % User time                : 0.356 s
% 0.30/1.03  % System time              : 0.023 s
% 0.30/1.03  % Total time               : 0.379 s
% 0.30/1.03  % Maximum resident set size: 4252 pages
% 0.30/1.03  
% 0.30/1.03  % -------------------------------------------------
% 0.30/1.03  % User time                : 1.756 s
% 0.30/1.03  % System time              : 0.083 s
% 0.30/1.03  % Total time               : 1.839 s
% 0.30/1.03  % Maximum resident set size: 4608 pages
% 0.30/1.03  % E exiting
%------------------------------------------------------------------------------