↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NUM301+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n008.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 : Tue May  5 04:53:06 PM UTC 2026

% Result   : Theorem 1.39s 1.75s
% Output   : CNFRefutation 1.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (  11 unt;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   21 (  11   ~;   7   |;   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    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   18 (   2 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(something_less_nn2,conjecture,
    ? [X1] : less(X1,nn2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_less_nn2) ).

fof(less_entry_point_neg_neg,axiom,
    ! [X1,X2,X10,X11] :
      ( ( rdn_translate(X1,rdn_neg(X10))
        & rdn_translate(X2,rdn_neg(X11))
        & rdn_positive_less(X11,X10) )
     => less(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).

fof(rdnn2,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).

fof(rdnn3,axiom,
    rdn_translate(nn3,rdn_neg(rdnn(n3))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn3) ).

fof(rdn_positive_less23,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X1] : less(X1,nn2),
    inference(assume_negation,[status(cth)],[something_less_nn2]) ).

fof(c_0_6,plain,
    ! [X179,X180,X181,X182] :
      ( ~ rdn_translate(X179,rdn_neg(X181))
      | ~ rdn_translate(X180,rdn_neg(X182))
      | ~ rdn_positive_less(X182,X181)
      | less(X179,X180) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg])]) ).

fof(c_0_7,negated_conjecture,
    ! [X276] : ~ less(X276,nn2),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

cnf(c_0_8,plain,
    ( less(X1,X3)
    | ~ rdn_translate(X1,rdn_neg(X2))
    | ~ rdn_translate(X3,rdn_neg(X4))
    | ~ rdn_positive_less(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(split_conjunct,[status(thm)],[rdnn2]) ).

cnf(c_0_10,negated_conjecture,
    ~ less(X1,nn2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ rdn_positive_less(rdnn(n2),X1)
    | ~ rdn_translate(X2,rdn_neg(X1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_12,plain,
    rdn_translate(nn3,rdn_neg(rdnn(n3))),
    inference(split_conjunct,[status(thm)],[rdnn3]) ).

cnf(c_0_13,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).

cnf(c_0_14,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM301+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n008.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 00:26:13 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.39/1.75  % Version  : CSE_E---1.7
% 1.39/1.75  % Problem  : theBenchmark.p
% 1.39/1.75  % SZS status Theorem for theBenchmark.p
% 1.39/1.75  % SZS output start CNFRefutation
% See solution above
% 1.39/1.75  % Total time : 1.372s
%------------------------------------------------------------------------------