TSTP Solution File: NUM322+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : NUM322+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n004.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 May  3 02:48:39 EDT 2024

% Result   : Theorem 3.80s 1.15s
% Output   : CNFRefutation 3.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  13 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  13   ~;   9   |;   2   &)
%                                         (   0 <=>;   2  =>;   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   :   24 (   1 sgn  17   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn5) ).

fof(f133,axiom,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn5) ).

fof(f291,axiom,
    ! [X12,X13,X9] :
      ( ( rdn_translate(X13,rdn_neg(X9))
        & rdn_translate(X12,rdn_pos(X9)) )
     => sum(X12,X13,n0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_entry_point_posx_negx) ).

fof(f402,conjecture,
    ? [X0] : sum(n5,nn5,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_n5_nn5_what) ).

fof(f403,negated_conjecture,
    ~ ? [X0] : sum(n5,nn5,X0),
    inference(negated_conjecture,[],[f402]) ).

fof(f415,plain,
    ! [X0,X1,X2] :
      ( ( rdn_translate(X1,rdn_neg(X2))
        & rdn_translate(X0,rdn_pos(X2)) )
     => sum(X0,X1,n0) ),
    inference(rectify,[],[f291]) ).

fof(f452,plain,
    ! [X0,X1,X2] :
      ( sum(X0,X1,n0)
      | ~ rdn_translate(X1,rdn_neg(X2))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(ennf_transformation,[],[f415]) ).

fof(f453,plain,
    ! [X0,X1,X2] :
      ( sum(X0,X1,n0)
      | ~ rdn_translate(X1,rdn_neg(X2))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(flattening,[],[f452]) ).

fof(f471,plain,
    ! [X0] : ~ sum(n5,nn5,X0),
    inference(ennf_transformation,[],[f403]) ).

fof(f480,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(cnf_transformation,[],[f6]) ).

fof(f607,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(cnf_transformation,[],[f133]) ).

fof(f767,plain,
    ! [X2,X0,X1] :
      ( sum(X0,X1,n0)
      | ~ rdn_translate(X1,rdn_neg(X2))
      | ~ rdn_translate(X0,rdn_pos(X2)) ),
    inference(cnf_transformation,[],[f453]) ).

fof(f879,plain,
    ! [X0] : ~ sum(n5,nn5,X0),
    inference(cnf_transformation,[],[f471]) ).

cnf(c_54,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(cnf_transformation,[],[f480]) ).

cnf(c_181,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(cnf_transformation,[],[f607]) ).

cnf(c_341,plain,
    ( ~ rdn_translate(X0,rdn_pos(X1))
    | ~ rdn_translate(X2,rdn_neg(X1))
    | sum(X0,X2,n0) ),
    inference(cnf_transformation,[],[f767]) ).

cnf(c_453,negated_conjecture,
    ~ sum(n5,nn5,X0),
    inference(cnf_transformation,[],[f879]) ).

cnf(c_5097,plain,
    ( ~ rdn_translate(X0,rdn_neg(rdnn(n5)))
    | sum(n5,X0,n0) ),
    inference(superposition,[status(thm)],[c_54,c_341]) ).

cnf(c_5145,plain,
    sum(n5,nn5,n0),
    inference(superposition,[status(thm)],[c_181,c_5097]) ).

cnf(c_5231,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5145,c_453]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM322+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu May  2 19:22:18 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.80/1.15  % SZS status Started for theBenchmark.p
% 3.80/1.15  % SZS status Theorem for theBenchmark.p
% 3.80/1.15  
% 3.80/1.15  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.80/1.15  
% 3.80/1.15  ------  iProver source info
% 3.80/1.15  
% 3.80/1.15  git: date: 2024-05-02 19:28:25 +0000
% 3.80/1.15  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.80/1.15  git: non_committed_changes: false
% 3.80/1.15  
% 3.80/1.15  ------ Parsing...
% 3.80/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.80/1.15  
% 3.80/1.15  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 3.80/1.15  
% 3.80/1.15  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.80/1.15  
% 3.80/1.15  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.80/1.15  ------ Proving...
% 3.80/1.15  ------ Problem Properties 
% 3.80/1.15  
% 3.80/1.15  
% 3.80/1.15  clauses                                 402
% 3.80/1.15  conjectures                             1
% 3.80/1.15  EPR                                     8
% 3.80/1.15  Horn                                    400
% 3.80/1.15  unary                                   376
% 3.80/1.15  binary                                  6
% 3.80/1.15  lits                                    472
% 3.80/1.15  lits eq                                 5
% 3.80/1.15  fd_pure                                 0
% 3.80/1.15  fd_pseudo                               0
% 3.80/1.15  fd_cond                                 0
% 3.80/1.15  fd_pseudo_cond                          5
% 3.80/1.15  AC symbols                              0
% 3.80/1.15  
% 3.80/1.15  ------ Input Options Time Limit: Unbounded
% 3.80/1.15  
% 3.80/1.15  
% 3.80/1.15  ------ 
% 3.80/1.15  Current options:
% 3.80/1.15  ------ 
% 3.80/1.15  
% 3.80/1.15  
% 3.80/1.15  
% 3.80/1.15  
% 3.80/1.15  ------ Proving...
% 3.80/1.15  
% 3.80/1.15  
% 3.80/1.15  % SZS status Theorem for theBenchmark.p
% 3.80/1.15  
% 3.80/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.80/1.15  
% 3.80/1.15  
%------------------------------------------------------------------------------