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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SYN338+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n011.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:30 EDT 2023

% Result   : Theorem 0.73s 1.16s
% Output   : CNFRefutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   5 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   23 (   8   ~;   0   |;  10   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :   24 (   2 sgn;  14   !;   7   ?)

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

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

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

fof(f4,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ~ big_f(X1,X1)
      & big_f(X2,X0)
      & big_f(X0,X1) ),
    inference(flattening,[],[f3]) ).

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

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

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

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

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

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

cnf(c_57,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_50]) ).


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