↑ Up

CSE_E---1.7.THM-CRf.s

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

% 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 : Tue May  5 04:53:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(sum_what_nn5_n0,conjecture,
    ? [X1] : sum(X1,nn5,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_what_nn5_n0) ).

fof(sum_entry_point_posx_negx,axiom,
    ! [X13,X14,X10] :
      ( ( rdn_translate(X13,rdn_pos(X10))
        & rdn_translate(X14,rdn_neg(X10)) )
     => sum(X13,X14,n0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',sum_entry_point_posx_negx) ).

fof(rdnn5,axiom,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn5) ).

fof(rdn5,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn5) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1] : sum(X1,nn5,n0),
    inference(assume_negation,[status(cth)],[sum_what_nn5_n0]) ).

fof(c_0_5,plain,
    ! [X214,X215,X216] :
      ( ~ rdn_translate(X214,rdn_pos(X216))
      | ~ rdn_translate(X215,rdn_neg(X216))
      | sum(X214,X215,n0) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_posx_negx])]) ).

fof(c_0_6,negated_conjecture,
    ! [X276] : ~ sum(X276,nn5,n0),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

cnf(c_0_7,plain,
    ( sum(X1,X3,n0)
    | ~ rdn_translate(X1,rdn_pos(X2))
    | ~ rdn_translate(X3,rdn_neg(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[rdnn5]) ).

cnf(c_0_9,negated_conjecture,
    ~ sum(X1,nn5,n0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[rdn5]) ).

cnf(c_0_11,plain,
    ~ rdn_translate(X1,rdn_pos(rdnn(n5))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

cnf(c_0_12,plain,
    $false,
    inference(sr,[status(thm)],[c_0_10,c_0_11]),
    [proof] ).

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