↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : NUM291+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% 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 : Fri Jul 25 12:27:52 PM UTC 2025

% Result   : Theorem 0.13s 0.35s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (  14 unt;   0 def)
%            Number of atoms       :   33 (   1 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   28 (  15   ~;   8   |;   3   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   12 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(n3_not_less_n2,plain,
    ~ less(n3,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n3_not_less_n2) ).

fof(n3_not_less_n2_negated,plain,
    ~ ~ less(n3,n2),
    inference(negate_conjecture,[status(cth)],[n3_not_less_n2]) ).

cnf(406,plain,
    less(n3,n2),
    inference(cnf,[status(esa)],[n3_not_less_n2_negated]) ).

cnf(l0,plain,
    less(n3,n2),
    inference(instantiation,[status(thm)],[406]) ).

fof(less_property,plain,
    ! [X,Y] :
      ( less(X,Y)
    <=> ( ~ less(Y,X)
        & Y != X ) ),
    file('Axioms/NUM005+1.ax',less_property) ).

cnf(283,plain,
    ( ~ less(X0,X1)
    | ~ less(X1,X0) ),
    inference(cnf,[status(esa)],[less_property]) ).

cnf(l1,plain,
    ( ~ less(n3,n2)
    | ~ less(n2,n3) ),
    inference(instantiation,[status(thm)],[283]) ).

fof(less_entry_point_pos_pos,plain,
    ! [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) ),
    file('Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).

cnf(280,plain,
    ( ~ rdn_translate(X0,rdn_pos(X1))
    | ~ rdn_translate(X2,rdn_pos(X3))
    | ~ rdn_positive_less(X1,X3)
    | less(X0,X2) ),
    inference(cnf,[status(esa)],[less_entry_point_pos_pos]) ).

cnf(l2,plain,
    ( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
    | ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
    | ~ rdn_positive_less(rdnn(n2),rdnn(n3))
    | less(n2,n3) ),
    inference(instantiation,[status(thm)],[280]) ).

fof(rdn2,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('Axioms/NUM005+0.ax',rdn2) ).

cnf(2,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf,[status(esa)],[rdn2]) ).

cnf(l3,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(instantiation,[status(thm)],[2]) ).

fof(rdn3,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('Axioms/NUM005+0.ax',rdn3) ).

cnf(3,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(cnf,[status(esa)],[rdn3]) ).

cnf(l4,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(instantiation,[status(thm)],[3]) ).

fof(rdn_positive_less23,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('Axioms/NUM005+1.ax',rdn_positive_less23) ).

cnf(267,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(cnf,[status(esa)],[rdn_positive_less23]) ).

cnf(l5,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(instantiation,[status(thm)],[267]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM291+1 : TPTP v9.0.0. Released v3.1.0.
% 0.04/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.33  % Computer : n031.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.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Jul 21 11:32:19 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  % launching worker at depth: 1
% 0.13/0.35  % launching worker at depth: 2
% 0.13/0.35  % launching worker at depth: 3
% 0.13/0.35  % launching worker at depth: 4
% 0.13/0.35  % launching worker at depth: 5
% 0.13/0.35  % launching worker at depth: 6
% 0.13/0.35  % launching worker at depth: 7
% 0.13/0.35  % launching worker at depth: 8
% 0.13/0.35  % launching worker at depth: 9
% 0.13/0.35  % SZS status Theorem for theBenchmark
% 0.13/0.35  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------