↑ Up

hopCoP---0.1.THM-CRf.s

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

% Computer : n022.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:54 PM UTC 2025

% Result   : Theorem 0.19s 0.40s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  16 unt;   0 def)
%            Number of atoms       :   35 (   9 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    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   15 (   1 sgn   6   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(something_not_n12,plain,
    ? [X] : X != n12,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_not_n12) ).

fof(something_not_n12_negated,plain,
    ~ ? [X] : X != n12,
    inference(negate_conjecture,[status(cth)],[something_not_n12]) ).

cnf(406,plain,
    X0 = n12,
    inference(cnf,[status(esa)],[something_not_n12_negated]) ).

cnf(l0,plain,
    nn1 = n12,
    inference(instantiation,[status(thm)],[406]) ).

fof(less_entry_point_neg_neg,plain,
    ! [X,Y,RDN_X,RDN_Y] :
      ( ( rdn_translate(X,rdn_neg(RDN_X))
        & rdn_translate(Y,rdn_neg(RDN_Y))
        & rdn_positive_less(RDN_Y,RDN_X) )
     => less(X,Y) ),
    file('Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).

cnf(282,plain,
    ( ~ rdn_translate(X0,rdn_neg(X1))
    | ~ rdn_translate(X2,rdn_neg(X3))
    | ~ rdn_positive_less(X3,X1)
    | less(X0,X2) ),
    inference(cnf,[status(esa)],[less_entry_point_neg_neg]) ).

cnf(l8,plain,
    ( ~ rdn_translate(n12,rdn_neg(rdnn(n2)))
    | ~ rdn_translate(nn1,rdn_neg(rdnn(n1)))
    | ~ rdn_positive_less(rdnn(n1),rdnn(n2))
    | less(n12,nn1) ),
    inference(instantiation,[status(thm)],[282]) ).

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

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

cnf(l9,plain,
    ( nn1 != n12
    | ~ less(n12,nn1) ),
    inference(instantiation,[status(thm)],[284]) ).

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

cnf(266,plain,
    rdn_positive_less(rdnn(n1),rdnn(n2)),
    inference(cnf,[status(esa)],[rdn_positive_less12]) ).

cnf(l14,plain,
    rdn_positive_less(rdnn(n1),rdnn(n2)),
    inference(instantiation,[status(thm)],[266]) ).

fof(rdnn1,plain,
    rdn_translate(nn1,rdn_neg(rdnn(n1))),
    file('Axioms/NUM005+0.ax',rdnn1) ).

cnf(128,plain,
    rdn_translate(nn1,rdn_neg(rdnn(n1))),
    inference(cnf,[status(esa)],[rdnn1]) ).

cnf(l12,plain,
    rdn_translate(nn1,rdn_neg(rdnn(n1))),
    inference(instantiation,[status(thm)],[128]) ).

cnf(l16,plain,
    rdn_neg(rdnn(n2)) = n12,
    inference(instantiation,[status(thm)],[406]) ).

fof(rdn12,plain,
    rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
    file('Axioms/NUM005+0.ax',rdn12) ).

cnf(12,plain,
    rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
    inference(cnf,[status(esa)],[rdn12]) ).

cnf(l13,plain,
    rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
    inference(instantiation,[status(thm)],[12]) ).

cnf(l11,plain,
    rdn_pos(rdn(rdnn(n2),rdnn(n1))) = n12,
    inference(instantiation,[status(thm)],[406]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l8,l9,l14,l12,l16,l13,l11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM304+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.13  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Jul 21 11:33:49 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % launching worker at depth: 1
% 0.13/0.35  % launching worker at depth: 7
% 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: 8
% 0.13/0.35  % launching worker at depth: 9
% 0.13/0.37  % launching worker at depth: 10
% 0.19/0.40  % SZS status Theorem for theBenchmark
% 0.19/0.40  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------