↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n026.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:30:01 PM UTC 2026

% Result   : Theorem 1.64s 1.07s
% Output   : CNFRefutation 1.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   52 (  26   ~;  18   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  18   !;   4   ?;   4   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f18,axiom,
    ! [X0,X1] :
      ( ~ r2(X0,X1)
      | ! [X2] :
          ( ~ r1(X2)
          | ~ id(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).

fof(f19,conjecture,
    ! [X0] :
      ( ! [X3] :
          ( ~ r1(X3)
          | ~ id(X3,X0) )
      | ! [X1] :
          ( ~ r2(X1,X0)
          | ! [X2] :
              ( ~ r2(X2,X1)
              | ~ r1(X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerounidtwo) ).

fof(f20,negated_conjecture,
    ~ ! [X0] :
        ( ! [X3] :
            ( ~ r1(X3)
            | ~ id(X3,X0) )
        | ! [X1] :
            ( ~ r2(X1,X0)
            | ! [X2] :
                ( ~ r2(X2,X1)
                | ~ r1(X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f19]) ).

fof(f21,plain,
    ? [X0] :
      ( ? [X3] :
          ( r1(X3)
          & id(X3,X0) )
      & ? [X1] :
          ( r2(X1,X0)
          & ? [X2] :
              ( r2(X2,X1)
              & r1(X2) ) ) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f31,plain,
    ( r1(sK23)
    & id(sK23,sK20)
    & r2(sK21,sK20)
    & r2(sK22,sK21)
    & r1(sK22) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X2,sK22),skolemize(X3,sK23)],[f21]) ).

fof(f89,plain,
    ! [X2,X0,X1] :
      ( ~ r2(X0,X1)
      | ~ r1(X2)
      | ~ id(X2,X1) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f90,plain,
    r1(sK23),
    inference(cnf_transformation,[],[f31]) ).

fof(f91,plain,
    id(sK23,sK20),
    inference(cnf_transformation,[],[f31]) ).

fof(f92,plain,
    r2(sK21,sK20),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_90,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ r1(X0)
      | ~ r2(X2,X1)
      | ~ id(X0,X1) ),
    inference(cnf_transformation,[],[f89]) ).

tcf(c_93,negated_conjecture,
    r2(sK21,sK20),
    inference(cnf_transformation,[],[f92]) ).

tcf(c_94,negated_conjecture,
    id(sK23,sK20),
    inference(cnf_transformation,[],[f91]) ).

tcf(c_95,negated_conjecture,
    r1(sK23),
    inference(cnf_transformation,[],[f90]) ).

tcf(c_463,plain,
    ! [X0: $i] :
      ( ~ r1(X0)
      | ~ r2(sK21,sK20)
      | ~ id(X0,sK20) ),
    inference(instantiation,[status(thm)],[c_90]) ).

tcf(c_579,plain,
    ( ~ r1(sK23)
    | ~ r2(sK21,sK20)
    | ~ id(sK23,sK20) ),
    inference(instantiation,[status(thm)],[c_463]) ).

tcf(c_580,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_579,c_93,c_94,c_95]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUN089+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n026.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.36  % DateTime : Thu Sep 24 06:03:54 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.40  Running first-order theorem proving
% 0.13/0.40  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.42  
% 0.13/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42  
% 0.13/0.42  % Detected problem language: tptp
% 0.13/0.43  % Proving...
% 1.64/1.07  % SZS status Started for theBenchmark.p
% 1.64/1.07  % SZS status Theorem for theBenchmark.p
% 1.64/1.07  
% 1.64/1.07  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.07  
% 1.64/1.07  % ------  iProver source info
% 1.64/1.07  
% 1.64/1.07  % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.07  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.07  % git: non_committed_changes: false
% 1.64/1.07  
% 1.64/1.07  % ------ Parsing...
% 1.64/1.07  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.64/1.07  
% 1.64/1.07  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.64/1.07  
% 1.64/1.07  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.64/1.07  % ------ Proving...
% 1.64/1.07  % ------ Problem Properties 
% 1.64/1.07  
% 1.64/1.07  % 
% 1.64/1.07  % clauses                               47
% 1.64/1.07  % conjectures                           5
% 1.64/1.07  % EPR                                   20
% 1.64/1.07  % Horn                                  43
% 1.64/1.07  % unary                                 23
% 1.64/1.07  % binary                                13
% 1.64/1.07  % lits                                  93
% 1.64/1.07  % lits eq                               0
% 1.64/1.07  % fd_pure                               0
% 1.64/1.07  % fd_pseudo                             0
% 1.64/1.07  % fd_cond                               0
% 1.64/1.07  % fd_pseudo_cond                        0
% 1.64/1.07  % AC symbols                            0
% 1.64/1.07  
% 1.64/1.07  % ------ Schedule dynamic 5 is on 
% 1.64/1.07  
% 1.64/1.07  % ------ no equalities: superposition off 
% 1.64/1.07  
% 1.64/1.07  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.64/1.07  
% 1.64/1.07  
% 1.64/1.07  % ------ 
% 1.64/1.07  % Current options:
% 1.64/1.07  % ------ 
% 1.64/1.07  
% 1.64/1.07  
% 1.64/1.07  % 
% 1.64/1.07  
% 1.64/1.07  % ------ Proving...
% 1.64/1.07  % 
% 1.64/1.07  
% 1.64/1.07  % SZS status Theorem for theBenchmark.p
% 1.64/1.07  
% 1.64/1.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.07  
% 1.64/1.07  
%------------------------------------------------------------------------------