↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n013.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:38 PM UTC 2026

% Result   : Theorem 4.58s 1.33s
% Output   : CNFRefutation 4.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (  14 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  15   ~;   9   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   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-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  28   !;   2   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn13) ).

fof(f129,axiom,
    rdn_translate(nn1,rdn_neg(rdnn(n1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn1) ).

fof(f282,axiom,
    ! [X0,X1,X2,X3] :
      ( ( rdn_translate(X1,rdn_pos(X3))
        & rdn_translate(X0,rdn_neg(X2)) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).

fof(f402,conjecture,
    ? [X0] : less(X0,n13),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_less_n13) ).

fof(f403,negated_conjecture,
    ~ ? [X0] : less(X0,n13),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f415,plain,
    ! [X0,X1,X2,X3] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_neg(X2))
      | less(X0,X1) ),
    inference(ennf_transformation,[],[f282]) ).

fof(f416,plain,
    ! [X0,X1,X2,X3] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_neg(X2))
      | less(X0,X1) ),
    inference(flattening,[],[f415]) ).

fof(f450,plain,
    ! [X0] : ~ less(X0,n13),
    inference(ennf_transformation,[],[f403]) ).

fof(f467,plain,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    inference(cnf_transformation,[],[f14]) ).

fof(f582,plain,
    rdn_translate(nn1,rdn_neg(rdnn(n1))),
    inference(cnf_transformation,[],[f129]) ).

fof(f735,plain,
    ! [X2,X3,X0,X1] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_neg(X2))
      | less(X0,X1) ),
    inference(cnf_transformation,[],[f416]) ).

fof(f858,plain,
    ! [X0] : ~ less(X0,n13),
    inference(cnf_transformation,[],[f450]) ).

tcf(c_62,plain,
    rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
    inference(cnf_transformation,[],[f467]) ).

tcf(c_177,plain,
    rdn_translate(nn1,rdn_neg(rdnn(n1))),
    inference(cnf_transformation,[],[f582]) ).

tcf(c_330,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( less(X0,X2)
      | ~ rdn_translate(X2,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_neg(X1)) ),
    inference(cnf_transformation,[],[f735]) ).

tcf(c_453,negated_conjecture,
    ! [X0: $i] : ~ less(X0,n13),
    inference(cnf_transformation,[],[f858]) ).

tcf(c_2990,negated_conjecture,
    ! [X0: $i] : ~ less(X0,n13),
    inference(demodulation,[status(thm)],[c_453]) ).

tcf(c_5174,plain,
    ! [X0: $i,X1: $i] :
      ( less(X0,n13)
      | ~ rdn_translate(X0,rdn_neg(X1)) ),
    inference(superposition,[status(thm)],[c_62,c_330]) ).

tcf(c_5175,plain,
    ! [X0: $i,X1: $i] : ~ rdn_translate(X0,rdn_neg(X1)),
    inference(forward_subsumption_resolution,[status(thm)],[c_5174,c_2990]) ).

tcf(c_5176,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_177,c_5175]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM293+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n013.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.37  % DateTime : Thu Sep 24 03:31:08 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.44  
% 0.13/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44  
% 0.13/0.44  % Detected problem language: tptp
% 0.13/0.45  % Proving...
% 4.58/1.33  % SZS status Started for theBenchmark.p
% 4.58/1.33  % SZS status Theorem for theBenchmark.p
% 4.58/1.33  
% 4.58/1.33  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.58/1.33  
% 4.58/1.33  % ------  iProver source info
% 4.58/1.33  
% 4.58/1.33  % git: date: 2026-07-19 20:42:38 +0200
% 4.58/1.33  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.58/1.33  % git: non_committed_changes: false
% 4.58/1.33  
% 4.58/1.33  % ------ Parsing...
% 4.58/1.33  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.58/1.33  
% 4.58/1.33  % ------ 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 % 
% 4.58/1.33  
% 4.58/1.33  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.58/1.33  
% 4.58/1.33  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.58/1.33  % ------ Proving...
% 4.58/1.33  % ------ Problem Properties 
% 4.58/1.33  
% 4.58/1.33  % 
% 4.58/1.33  % clauses                               402
% 4.58/1.33  % conjectures                           1
% 4.58/1.33  % EPR                                   8
% 4.58/1.33  % Horn                                  400
% 4.58/1.33  % unary                                 376
% 4.58/1.33  % binary                                6
% 4.58/1.33  % lits                                  472
% 4.58/1.33  % lits eq                               5
% 4.58/1.33  % fd_pure                               0
% 4.58/1.33  % fd_pseudo                             0
% 4.58/1.33  % fd_cond                               0
% 4.58/1.33  % fd_pseudo_cond                        5
% 4.58/1.33  % AC symbols                            0
% 4.58/1.33  
% 4.58/1.33  % ------ Schedule dynamic 5 is on 
% 4.58/1.33  
% 4.58/1.33  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.58/1.33  
% 4.58/1.33  
% 4.58/1.33  % ------ 
% 4.58/1.33  % Current options:
% 4.58/1.33  % ------ 
% 4.58/1.33  
% 4.58/1.33  
% 4.58/1.33  % 
% 4.58/1.33  
% 4.58/1.33  % ------ Proving...
% 4.58/1.33  % 
% 4.58/1.33  
% 4.58/1.33  % SZS status Theorem for theBenchmark.p
% 4.58/1.33  
% 4.58/1.33  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.58/1.33  
% 4.58/1.33  
%------------------------------------------------------------------------------