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

View Problem - Process Solution

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

% Computer : n020.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:09:38 EDT 2023

% Result   : Theorem 0.67s 1.14s
% Output   : CNFRefutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   5 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   36 (  14   ~;   5   |;   9   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   38 (   2 sgn;  23   !;  12   ?)

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

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( ! [X1] : p(X1,X0)
         => ! [X2] : q(X2,X0) )
     => ? [X3] :
          ( ? [X4] : p(X4,X3)
         => ? [X5] :
              ( q(X5,X3)
              | p(X3,X5) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

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

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

fof(f5,plain,
    ! [X0] :
      ( ? [X2] : p(X2,X0)
     => p(sK0(X0),X0) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ! [X3] :
      ( ? [X5] : ~ p(X5,X3)
     => ~ p(sK1(X3),X3) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ( ! [X0] :
        ( ! [X1] :
            ( ~ q(X1,X0)
            & ~ p(X0,X1) )
        & p(sK0(X0),X0) )
    & ! [X3] :
        ( ! [X4] : q(X4,X3)
        | ~ p(sK1(X3),X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f6,f5]) ).

fof(f9,plain,
    ! [X0] : p(sK0(X0),X0),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ! [X0,X1] : ~ p(X0,X1),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_50,negated_conjecture,
    ~ p(X0,X1),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_51,negated_conjecture,
    p(sK0(X0),X0),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_63,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_51,c_50]) ).


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