↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM326+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:23:42 PM UTC 2026

% Result   : Theorem 2.16s 1.29s
% Output   : CNFRefutation 2.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  13 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   24 (  13   ~;   9   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            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   :   21 (   0 sgn  19   !;   2   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn5) ).

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

fof(f291,axiom,
    ! [X0,X1,X2] :
      ( ( rdn_translate(X1,rdn_neg(X2))
        & rdn_translate(X0,rdn_pos(X2)) )
     => sum(X0,X1,n0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_posx_negx) ).

fof(f402,conjecture,
    ? [X0] : sum(X0,nn5,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_what_nn5_n0) ).

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

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

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

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

fof(f434,plain,
    ! [X0] : ~ sum(X0,nn5,n0),
    inference(cnf_transformation,[],[f404]) ).

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

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

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

tcf(c_49,negated_conjecture,
    ! [X0: $i] : ~ sum(X0,nn5,n0),
    inference(cnf_transformation,[],[f434]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( sum(X0,X2,n0)
      | ~ rdn_translate(X2,rdn_neg(X1))
      | ~ rdn_translate(X0,rdn_pos(X1)) ),
    inference(cnf_transformation,[],[f443]) ).

tcf(c_63,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(cnf_transformation,[],[f448]) ).

tcf(c_176,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(cnf_transformation,[],[f561]) ).

tcf(c_2275,plain,
    ! [X0: $i] :
      ( sum(n5,X0,n0)
      | ~ rdn_translate(X0,rdn_neg(rdnn(n5))) ),
    inference(superposition,[status(thm)],[c_176,c_58]) ).

tcf(c_2468,plain,
    sum(n5,nn5,n0),
    inference(superposition,[status(thm)],[c_63,c_2275]) ).

tcf(c_2469,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2468,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM326+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n008.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 03:37:54 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41  
% 0.13/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41  
% 0.13/0.41  % Detected problem language: tptp
% 0.13/0.43  % Proving...
% 2.16/1.29  % SZS status Started for theBenchmark.p
% 2.16/1.29  % SZS status Theorem for theBenchmark.p
% 2.16/1.29  
% 2.16/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.16/1.29  
% 2.16/1.29  % ------  iProver source info
% 2.16/1.29  
% 2.16/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 2.16/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.16/1.29  % git: non_committed_changes: false
% 2.16/1.29  
% 2.16/1.29  % ------ Parsing...
% 2.16/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.16/1.29  
% 2.16/1.29  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.16/1.29  
% 2.16/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.16/1.29  % ------ Proving...
% 2.16/1.29  % ------ Problem Properties 
% 2.16/1.29  
% 2.16/1.29  % 
% 2.16/1.29  % clauses                               146
% 2.16/1.29  % conjectures                           1
% 2.16/1.29  % EPR                                   1
% 2.16/1.29  % Horn                                  146
% 2.16/1.29  % unary                                 130
% 2.16/1.29  % binary                                4
% 2.16/1.29  % lits                                  195
% 2.16/1.29  % lits eq                               0
% 2.16/1.29  % fd_pure                               0
% 2.16/1.29  % fd_pseudo                             0
% 2.16/1.29  % fd_cond                               0
% 2.16/1.29  % fd_pseudo_cond                        0
% 2.16/1.29  % AC symbols                            0
% 2.16/1.29  
% 2.16/1.29  % ------ Schedule dynamic 5 is on 
% 2.16/1.29  
% 2.16/1.29  % ------ no equalities: superposition off 
% 2.16/1.29  
% 2.16/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.16/1.29  
% 2.16/1.29  
% 2.16/1.29  % ------ 
% 2.16/1.29  % Current options:
% 2.16/1.29  % ------ 
% 2.16/1.29  
% 2.16/1.29  
% 2.16/1.29  % 
% 2.16/1.29  
% 2.16/1.29  % ------ Proving...
% 2.16/1.29  % 
% 2.16/1.29  
% 2.16/1.29  % SZS status Theorem for theBenchmark.p
% 2.16/1.29  
% 2.16/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.16/1.29  
% 2.16/1.29  
%------------------------------------------------------------------------------