↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN363+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/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 03:39:51 PM UTC 2026

% Result   : Theorem 0.36s 1.14s
% Output   : CNFRefutation 0.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   8 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   40 (  17   ~;   9   |;  10   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   41 (   0 sgn  34   !;   7   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ! [X1] :
          ( ? [X2] : big_r(X1,X2)
         => big_r(a,X1) )
      & ! [X0] : big_r(X0,b) )
   => ? [X3] :
      ! [X4] : big_r(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2114) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X1] :
            ( ? [X2] : big_r(X1,X2)
           => big_r(a,X1) )
        & ! [X0] : big_r(X0,b) )
     => ? [X3] :
        ! [X4] : big_r(X3,X4) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X1] :
        ( ! [X2] : ~ big_r(X1,X2)
        | big_r(a,X1) )
    & ! [X0] : big_r(X0,b)
    & ! [X3] :
      ? [X4] : ~ big_r(X3,X4) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ! [X1] :
        ( ! [X2] : ~ big_r(X1,X2)
        | big_r(a,X1) )
    & ! [X0] : big_r(X0,b)
    & ! [X3] :
      ? [X4] : ~ big_r(X3,X4) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ( ! [X3] :
        ( ! [X4] : ~ big_r(X3,X4)
        | big_r(a,X3) )
    & ! [X2] : big_r(X2,b)
    & ! [X0] :
      ? [X1] : ~ big_r(X0,X1) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ! [X3] :
        ( ! [X4] : ~ big_r(X3,X4)
        | big_r(a,X3) )
    & ! [X2] : big_r(X2,b)
    & ! [X0] : ~ big_r(X0,sK0(X0)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f5]) ).

fof(f7,plain,
    ! [X3,X4] :
      ( ~ big_r(X3,X4)
      | big_r(a,X3) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ! [X2] : big_r(X2,b),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    ! [X0] : ~ big_r(X0,sK0(X0)),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i] : ~ big_r(X0,sK0(X0)),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i] : big_r(X0,b),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_r(a,X0)
      | ~ big_r(X0,X1) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_53,plain,
    ~ big_r(a,sK0(a)),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_62,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( big_r(a,X0)
      | ~ big_r(X0,X1) ),
    inference(demodulation,[status(thm)],[c_51]) ).

tcf(c_63,negated_conjecture,
    ! [X0: $i] : big_r(X0,b),
    inference(demodulation,[status(thm)],[c_50]) ).

tcf(c_65,plain,
    ! [X0: $i] :
      ( big_r(a,X0)
      | ~ big_r(X0,b) ),
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_67,plain,
    ( big_r(a,sK0(a))
    | ~ big_r(sK0(a),b) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_71,plain,
    big_r(sK0(a),b),
    inference(instantiation,[status(thm)],[c_63]) ).

tcf(c_72,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_71,c_67,c_53]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN363+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.43  % Computer : n008.cluster.edu
% 0.16/0.43  % Model    : x86_64 x86_64
% 0.16/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43  % Memory   : 8046.5625MB
% 0.16/0.43  % OS       : Linux 6.8.0-71-generic
% 0.16/0.43  % CPULimit : 300
% 0.16/0.43  % WCLimit  : 300
% 0.16/0.43  % DateTime : Fri Sep 25 01:00:26 UTC 2026
% 0.16/0.44  % CPUTime  : 
% 0.16/0.44  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/0.48  Running first-order theorem proving
% 0.16/0.48  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.16/0.49  
% 0.16/0.49  % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.49  
% 0.16/0.50  % Detected problem language: tptp
% 0.24/0.51  % Proving...
% 0.36/1.14  % SZS status Started for theBenchmark.p
% 0.36/1.14  % SZS status Theorem for theBenchmark.p
% 0.36/1.14  
% 0.36/1.14  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.36/1.14  
% 0.36/1.14  % ------  iProver source info
% 0.36/1.14  
% 0.36/1.14  % git: date: 2026-07-19 20:42:38 +0200
% 0.36/1.14  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.36/1.14  % git: non_committed_changes: false
% 0.36/1.14  
% 0.36/1.14  % ------ Parsing...
% 0.36/1.14  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.36/1.14  
% 0.36/1.14  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 0.36/1.14  
% 0.36/1.14  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.36/1.14  % ------ Proving...
% 0.36/1.14  % ------ Problem Properties 
% 0.36/1.14  
% 0.36/1.14  % 
% 0.36/1.14  % clauses                               3
% 0.36/1.14  % conjectures                           3
% 0.36/1.14  % EPR                                   2
% 0.36/1.14  % Horn                                  3
% 0.36/1.14  % unary                                 2
% 0.36/1.14  % binary                                1
% 0.36/1.14  % lits                                  4
% 0.36/1.14  % lits eq                               0
% 0.36/1.14  % fd_pure                               0
% 0.36/1.14  % fd_pseudo                             0
% 0.36/1.14  % fd_cond                               0
% 0.36/1.14  % fd_pseudo_cond                        0
% 0.36/1.14  % AC symbols                            0
% 0.36/1.14  
% 0.36/1.14  % ------ Schedule dynamic 5 is on 
% 0.36/1.14  
% 0.36/1.14  % ------ no equalities: superposition off 
% 0.36/1.14  
% 0.36/1.14  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.36/1.14  
% 0.36/1.14  
% 0.36/1.14  % ------ 
% 0.36/1.14  % Current options:
% 0.36/1.14  % ------ 
% 0.36/1.14  
% 0.36/1.14  
% 0.36/1.14  % 
% 0.36/1.14  
% 0.36/1.14  % ------ Proving...
% 0.36/1.14  % 
% 0.36/1.14  
% 0.36/1.14  % SZS status Theorem for theBenchmark.p
% 0.36/1.14  
% 0.36/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.36/1.14  
% 0.36/1.14  
%------------------------------------------------------------------------------