↑ Up

Metis---2.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : NUM290+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n007.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  : 600s
% DateTime : Mon Jul 18 12:25:45 EDT 2022

% Result   : Theorem 5.72s 6.01s
% Output   : CNFRefutation 5.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  16 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  20   ~;  17   |;   2   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   20 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rdn2,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))) ).

fof(rdn3,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))) ).

fof(rdn_positive_less23,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)) ).

fof(less_entry_point_pos_pos,axiom,
    ! [X,Y,RDN_X,RDN_Y] :
      ( ( rdn_translate(X,rdn_pos(RDN_X))
        & rdn_translate(Y,rdn_pos(RDN_Y))
        & rdn_positive_less(RDN_X,RDN_Y) )
     => less(X,Y) ) ).

fof(n2_less_n3,conjecture,
    less(n2,n3) ).

fof(subgoal_0,plain,
    less(n2,n3),
    inference(strip,[],[n2_less_n3]) ).

fof(negate_0_0,plain,
    ~ less(n2,n3),
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(canonicalize,[],[rdn2]) ).

fof(normalize_0_1,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(canonicalize,[],[rdn3]) ).

fof(normalize_0_2,plain,
    ! [RDN_X,RDN_Y,X,Y] :
      ( ~ rdn_positive_less(RDN_X,RDN_Y)
      | ~ rdn_translate(X,rdn_pos(RDN_X))
      | ~ rdn_translate(Y,rdn_pos(RDN_Y))
      | less(X,Y) ),
    inference(canonicalize,[],[less_entry_point_pos_pos]) ).

fof(normalize_0_3,plain,
    ! [RDN_X,RDN_Y,X,Y] :
      ( ~ rdn_positive_less(RDN_X,RDN_Y)
      | ~ rdn_translate(X,rdn_pos(RDN_X))
      | ~ rdn_translate(Y,rdn_pos(RDN_Y))
      | less(X,Y) ),
    inference(specialize,[],[normalize_0_2]) ).

fof(normalize_0_4,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(canonicalize,[],[rdn_positive_less23]) ).

fof(normalize_0_5,plain,
    ~ less(n2,n3),
    inference(canonicalize,[],[negate_0_0]) ).

cnf(refute_0_0,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(canonicalize,[],[normalize_0_0]) ).

cnf(refute_0_1,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(canonicalize,[],[normalize_0_1]) ).

cnf(refute_0_2,plain,
    ( ~ rdn_positive_less(RDN_X,RDN_Y)
    | ~ rdn_translate(X,rdn_pos(RDN_X))
    | ~ rdn_translate(Y,rdn_pos(RDN_Y))
    | less(X,Y) ),
    inference(canonicalize,[],[normalize_0_3]) ).

cnf(refute_0_3,plain,
    ( ~ rdn_positive_less(X_8822,rdnn(n3))
    | ~ rdn_translate(X_8824,rdn_pos(X_8822))
    | ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
    | less(X_8824,n3) ),
    inference(subst,[],[refute_0_2:[bind(RDN_X,$fot(X_8822)),bind(RDN_Y,$fot(rdnn(n3))),bind(X,$fot(X_8824)),bind(Y,$fot(n3))]]) ).

cnf(refute_0_4,plain,
    ( ~ rdn_positive_less(X_8822,rdnn(n3))
    | ~ rdn_translate(X_8824,rdn_pos(X_8822))
    | less(X_8824,n3) ),
    inference(resolve,[$cnf( rdn_translate(n3,rdn_pos(rdnn(n3))) )],[refute_0_1,refute_0_3]) ).

cnf(refute_0_5,plain,
    ( ~ rdn_positive_less(rdnn(n2),rdnn(n3))
    | ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
    | less(n2,n3) ),
    inference(subst,[],[refute_0_4:[bind(X_8822,$fot(rdnn(n2))),bind(X_8824,$fot(n2))]]) ).

cnf(refute_0_6,plain,
    ( ~ rdn_positive_less(rdnn(n2),rdnn(n3))
    | less(n2,n3) ),
    inference(resolve,[$cnf( rdn_translate(n2,rdn_pos(rdnn(n2))) )],[refute_0_0,refute_0_5]) ).

cnf(refute_0_7,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(canonicalize,[],[normalize_0_4]) ).

cnf(refute_0_8,plain,
    less(n2,n3),
    inference(resolve,[$cnf( rdn_positive_less(rdnn(n2),rdnn(n3)) )],[refute_0_7,refute_0_6]) ).

cnf(refute_0_9,plain,
    ~ less(n2,n3),
    inference(canonicalize,[],[normalize_0_5]) ).

cnf(refute_0_10,plain,
    $false,
    inference(resolve,[$cnf( less(n2,n3) )],[refute_0_8,refute_0_9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM290+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : metis --show proof --show saturation %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jul  6 04:29:28 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 5.72/6.01  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.72/6.01  
% 5.72/6.01  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.72/6.01  
%------------------------------------------------------------------------------