TSTP Solution File: SYN371+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SYN371+1 : TPTP v8.1.2. Released v2.0.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 Sep  1 03:06:44 EDT 2023

% Result   : Theorem 0.78s 1.17s
% Output   : CNFRefutation 0.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   33 (  13   ~;   5   |;   8   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   31 (   0 sgn;  18   !;   7   ?)

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

fof(f2,negated_conjecture,
    ~ ( ( ? [X0] : big_r(X0,X0)
       => ! [X1] : big_r(X1,X1) )
     => ? [X2] :
        ! [X3] :
          ( big_r(X2,X2)
         => big_r(X3,X3) ) ),
    inference(negated_conjecture,[],[f1]) ).

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

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

fof(f5,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ big_r(X1,X1)
          & big_r(X0,X0) )
     => ( ~ big_r(sK0(X0),sK0(X0))
        & big_r(X0,X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ big_r(sK0(X0),sK0(X0))
        & big_r(X0,X0) )
    & ( ! [X2] : big_r(X2,X2)
      | ! [X3] : ~ big_r(X3,X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).

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

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

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

cnf(c_49,negated_conjecture,
    ~ big_r(sK0(X0),sK0(X0)),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_50,negated_conjecture,
    big_r(X0,X0),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_51,negated_conjecture,
    ( ~ big_r(X0,X0)
    | big_r(X1,X1) ),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_54,plain,
    big_r(X1,X1),
    inference(global_subsumption_just,[status(thm)],[c_51,c_50,c_51]) ).

cnf(c_55,negated_conjecture,
    big_r(X0,X0),
    inference(renaming,[status(thm)],[c_54]) ).

cnf(c_58,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_55]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN371+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n004.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Sat Aug 26 18:46:08 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.78/1.17  % SZS status Started for theBenchmark.p
% 0.78/1.17  % SZS status Theorem for theBenchmark.p
% 0.78/1.17  
% 0.78/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.78/1.17  
% 0.78/1.17  ------  iProver source info
% 0.78/1.17  
% 0.78/1.17  git: date: 2023-05-31 18:12:56 +0000
% 0.78/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.78/1.17  git: non_committed_changes: false
% 0.78/1.17  git: last_make_outside_of_git: false
% 0.78/1.17  
% 0.78/1.17  ------ Parsing...
% 0.78/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.78/1.17  
% 0.78/1.17  ------ Preprocessing...
% 0.78/1.17  
% 0.78/1.17  % SZS status Theorem for theBenchmark.p
% 0.78/1.17  
% 0.78/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.78/1.17  
% 0.78/1.17  
%------------------------------------------------------------------------------