TSTP Solution File: SYN000_1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SYN000_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.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 : Mon Jun 24 19:36:40 EDT 2024

% Result   : Theorem 0.77s 1.13s
% Output   : CNFRefutation 0.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  101 (  40   ~;  37   |;  18   &)
%                                         (   2 <=>;   2  =>;   0  <=;   2 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   35 (   2 sgn  18   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0] :
      ( ( ~ q(X0,a)
       => p(X0) )
    <=> ? [X1,X2] :
          ( r(X0,f(X1),g(X0,f(X1),X2))
        <~> ~ s(f(f(f(b)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',useful_connectives) ).

fof(f9,axiom,
    p(h),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',role_hypothesis) ).

fof(f10,conjecture,
    ? [X0] : p(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',role_conjecture) ).

fof(f11,negated_conjecture,
    ~ ? [X0] : p(X0),
    inference(negated_conjecture,[],[f10]) ).

fof(f25,plain,
    ! [X0] :
      ( ( p(X0)
        | q(X0,a) )
    <=> ? [X1,X2] :
          ( r(X0,f(X1),g(X0,f(X1),X2))
        <~> ~ s(f(f(f(b)))) ) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f27,plain,
    ! [X0] : ~ p(X0),
    inference(ennf_transformation,[],[f11]) ).

fof(f32,plain,
    ! [X0] :
      ( ( p(X0)
        | q(X0,a)
        | ! [X1,X2] :
            ( ( r(X0,f(X1),g(X0,f(X1),X2))
              | s(f(f(f(b)))) )
            & ( ~ s(f(f(f(b))))
              | ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
      & ( ? [X1,X2] :
            ( ( s(f(f(f(b))))
              | ~ r(X0,f(X1),g(X0,f(X1),X2)) )
            & ( ~ s(f(f(f(b))))
              | r(X0,f(X1),g(X0,f(X1),X2)) ) )
        | ( ~ p(X0)
          & ~ q(X0,a) ) ) ),
    inference(nnf_transformation,[],[f25]) ).

fof(f33,plain,
    ! [X0] :
      ( ( p(X0)
        | q(X0,a)
        | ! [X1,X2] :
            ( ( r(X0,f(X1),g(X0,f(X1),X2))
              | s(f(f(f(b)))) )
            & ( ~ s(f(f(f(b))))
              | ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
      & ( ? [X1,X2] :
            ( ( s(f(f(f(b))))
              | ~ r(X0,f(X1),g(X0,f(X1),X2)) )
            & ( ~ s(f(f(f(b))))
              | r(X0,f(X1),g(X0,f(X1),X2)) ) )
        | ( ~ p(X0)
          & ~ q(X0,a) ) ) ),
    inference(flattening,[],[f32]) ).

fof(f34,plain,
    ! [X0] :
      ( ( p(X0)
        | q(X0,a)
        | ! [X1,X2] :
            ( ( r(X0,f(X1),g(X0,f(X1),X2))
              | s(f(f(f(b)))) )
            & ( ~ s(f(f(f(b))))
              | ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
      & ( ? [X3,X4] :
            ( ( s(f(f(f(b))))
              | ~ r(X0,f(X3),g(X0,f(X3),X4)) )
            & ( ~ s(f(f(f(b))))
              | r(X0,f(X3),g(X0,f(X3),X4)) ) )
        | ( ~ p(X0)
          & ~ q(X0,a) ) ) ),
    inference(rectify,[],[f33]) ).

fof(f35,plain,
    ! [X0] :
      ( ? [X3,X4] :
          ( ( s(f(f(f(b))))
            | ~ r(X0,f(X3),g(X0,f(X3),X4)) )
          & ( ~ s(f(f(f(b))))
            | r(X0,f(X3),g(X0,f(X3),X4)) ) )
     => ( ( s(f(f(f(b))))
          | ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) )
        & ( ~ s(f(f(f(b))))
          | r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f36,plain,
    ! [X0] :
      ( ( p(X0)
        | q(X0,a)
        | ! [X1,X2] :
            ( ( r(X0,f(X1),g(X0,f(X1),X2))
              | s(f(f(f(b)))) )
            & ( ~ s(f(f(f(b))))
              | ~ r(X0,f(X1),g(X0,f(X1),X2)) ) ) )
      & ( ( ( s(f(f(f(b))))
            | ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) )
          & ( ~ s(f(f(f(b))))
            | r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0))) ) )
        | ( ~ p(X0)
          & ~ q(X0,a) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f34,f35]) ).

fof(f47,plain,
    ! [X0] :
      ( s(f(f(f(b))))
      | ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f36]) ).

fof(f54,plain,
    p(h),
    inference(cnf_transformation,[],[f9]) ).

fof(f55,plain,
    ! [X0] : ~ p(X0),
    inference(cnf_transformation,[],[f27]) ).

cnf(c_56,plain,
    ( ~ r(X0,f(sK3(X0)),g(X0,f(sK3(X0)),sK4(X0)))
    | ~ p(X0)
    | s(f(f(f(b)))) ),
    inference(cnf_transformation,[],[f47]) ).

cnf(c_64,plain,
    p(h),
    inference(cnf_transformation,[],[f54]) ).

cnf(c_65,negated_conjecture,
    ~ p(X0),
    inference(cnf_transformation,[],[f55]) ).

cnf(c_88,plain,
    ~ p(X0),
    inference(global_subsumption_just,[status(thm)],[c_56,c_65]) ).

cnf(c_96,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_64,c_88]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN000_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Jun 24 00:07:09 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.77/1.13  % SZS status Started for theBenchmark.p
% 0.77/1.13  % SZS status Theorem for theBenchmark.p
% 0.77/1.13  
% 0.77/1.13  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.77/1.13  
% 0.77/1.13  ------  iProver source info
% 0.77/1.13  
% 0.77/1.13  git: date: 2024-06-12 09:56:46 +0000
% 0.77/1.13  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.77/1.13  git: non_committed_changes: false
% 0.77/1.13  
% 0.77/1.13  ------ Parsing...
% 0.77/1.13  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.77/1.13  
% 0.77/1.13  
% 0.77/1.13  ------ Preprocessing...
% 0.77/1.13  
% 0.77/1.13  % SZS status Theorem for theBenchmark.p
% 0.77/1.13  
% 0.77/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.77/1.13  
% 0.77/1.13  
%------------------------------------------------------------------------------