TSTP Solution File: NUM838+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : NUM838+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n005.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 10:40:54 EDT 2023

% Result   : Theorem 0.19s 0.60s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   25
% Syntax   : Number of formulae    :   55 (  30 unt;  16 typ;   0 def)
%            Number of atoms       :   51 (  35 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  19   ~;  11   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   22 (  12   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-2 aty)
%            Number of variables   :   67 (  12 sgn;  32   !;   3   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    vd301: $i ).

tff(decl_23,type,
    vd303: $i ).

tff(decl_24,type,
    vplus: ( $i * $i ) > $i ).

tff(decl_25,type,
    vd302: $i ).

tff(decl_26,type,
    greater: ( $i * $i ) > $o ).

tff(decl_27,type,
    less: ( $i * $i ) > $o ).

tff(decl_28,type,
    vskolem7: ( $i * $i ) > $i ).

tff(decl_29,type,
    leq: ( $i * $i ) > $o ).

tff(decl_30,type,
    geq: ( $i * $i ) > $o ).

tff(decl_31,type,
    vsucc: $i > $i ).

tff(decl_32,type,
    v1: $i ).

tff(decl_33,type,
    vskolem2: $i > $i ).

tff(decl_34,type,
    esk1_2: ( $i * $i ) > $i ).

tff(decl_35,type,
    esk2_2: ( $i * $i ) > $i ).

tff(decl_36,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_37,type,
    esk4_2: ( $i * $i ) > $i ).

fof('ass(cond(73, 0), 0)',axiom,
    ! [X46,X47] : X47 != vplus(X46,X47),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).

fof('ass(cond(33, 0), 0)',axiom,
    ! [X53,X54,X55] : vplus(vplus(X53,X54),X55) = vplus(X53,vplus(X54,X55)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X48,X49] : vplus(X49,X48) = vplus(X48,X49),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).

fof('ass(cond(proof(196), 0), 9)',axiom,
    ! [X1,X6,X7] :
      ( greater(X6,X7)
     => X6 = vplus(X7,vskolem7(X6,X7)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 9)') ).

fof('holds(antec(195), 304, 0)',axiom,
    greater(vd301,vd302),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(195), 304, 0)') ).

fof('ass(cond(goal(88), 0), 1)',axiom,
    ! [X39,X40] :
      ( X39 != X40
      | ~ ? [X42] : X40 = vplus(X39,X42) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).

fof('ass(cond(189, 0), 0)',axiom,
    ! [X8,X9] : greater(vplus(X8,X9),X8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(189, 0), 0)') ).

fof('ass(cond(goal(88), 0), 0)',axiom,
    ! [X39,X40] :
      ( X39 = X40
      | ? [X41] : X39 = vplus(X40,X41)
      | ? [X42] : X40 = vplus(X39,X42) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 0)') ).

fof('holds(conseq(195), 305, 0)',conjecture,
    greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(195), 305, 0)') ).

fof(c_0_9,plain,
    ! [X153,X154] : X154 != vplus(X153,X154),
    inference(variable_rename,[status(thm)],['ass(cond(73, 0), 0)']) ).

fof(c_0_10,plain,
    ! [X160,X161,X162] : vplus(vplus(X160,X161),X162) = vplus(X160,vplus(X161,X162)),
    inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).

cnf(c_0_11,plain,
    X1 != vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X155,X156] : vplus(X156,X155) = vplus(X155,X156),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

fof(c_0_14,plain,
    ! [X91,X92] :
      ( ~ greater(X91,X92)
      | X91 = vplus(X92,vskolem7(X91,X92)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['ass(cond(proof(196), 0), 9)'])])]) ).

cnf(c_0_15,plain,
    vplus(X1,vplus(X2,X3)) != X3,
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    vplus(X1,X2) = vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( X1 = vplus(X2,vskolem7(X1,X2))
    | ~ greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    greater(vd301,vd302),
    inference(split_conjunct,[status(thm)],['holds(antec(195), 304, 0)']) ).

fof(c_0_19,plain,
    ! [X140,X141,X142] :
      ( X140 != X141
      | X141 != vplus(X140,X142) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(88), 0), 1)'])])]) ).

cnf(c_0_20,plain,
    vplus(X1,vplus(X2,X3)) != X2,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    vplus(vd302,vskolem7(vd301,vd302)) = vd301,
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( X1 != X2
    | X2 != vplus(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

fof(c_0_23,plain,
    ! [X93,X94] : greater(vplus(X93,X94),X93),
    inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).

cnf(c_0_24,plain,
    vplus(X1,vd301) != vd302,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_25,plain,
    ! [X136,X137] :
      ( X136 = X137
      | X136 = vplus(X137,esk3_2(X136,X137))
      | X137 = vplus(X136,esk4_2(X136,X137)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['ass(cond(goal(88), 0), 0)'])]) ).

cnf(c_0_26,plain,
    vplus(X1,X2) != X1,
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_27,plain,
    greater(vplus(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_28,plain,
    vplus(vd301,X1) != vd302,
    inference(spm,[status(thm)],[c_0_24,c_0_16]) ).

cnf(c_0_29,plain,
    ( X1 = X2
    | X1 = vplus(X2,esk3_2(X1,X2))
    | X2 = vplus(X1,esk4_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_30,plain,
    vd302 != vd301,
    inference(spm,[status(thm)],[c_0_26,c_0_21]) ).

cnf(c_0_31,plain,
    greater(vplus(X1,vplus(X2,X3)),vplus(X1,X2)),
    inference(spm,[status(thm)],[c_0_27,c_0_12]) ).

cnf(c_0_32,plain,
    vplus(vd302,esk4_2(vd302,vd301)) = vd301,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29])]),c_0_30]) ).

cnf(c_0_33,plain,
    greater(vplus(X1,vd301),vplus(X1,vd302)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

fof(c_0_34,negated_conjecture,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(195), 305, 0)'])]) ).

cnf(c_0_35,plain,
    greater(vplus(X1,vd301),vplus(vd302,X1)),
    inference(spm,[status(thm)],[c_0_33,c_0_16]) ).

cnf(c_0_36,negated_conjecture,
    ~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_37,plain,
    greater(vplus(vd301,X1),vplus(vd302,X1)),
    inference(spm,[status(thm)],[c_0_35,c_0_16]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : NUM838+1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Aug 25 15:24:08 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 0.19/0.60  % Version  : CSE_E---1.5
% 0.19/0.60  % Problem  : theBenchmark.p
% 0.19/0.60  % Proof found
% 0.19/0.60  % SZS status Theorem for theBenchmark.p
% 0.19/0.60  % SZS output start Proof
% See solution above
% 0.19/0.60  % Total time : 0.037000 s
% 0.19/0.60  % SZS output end Proof
% 0.19/0.60  % Total time : 0.040000 s
%------------------------------------------------------------------------------