%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SYN965+1 : TPTP v8.1.2. Released v3.1.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 May  3 03:33:44 EDT 2024

% Result   : Theorem 0.48s 1.17s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   3 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   53 (  18   ~;  11   |;  19   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 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   :   45 (   8 sgn  24   !;   9   ?)

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

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

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

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

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

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

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

fof(f10,plain,
    ! [X2,X3,X0] :
      ( p(X2,X0)
      | ~ p(X3,X2) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f12,plain,
    ! [X2,X3,X0] :
      ( ~ p(X2,sK0(X0))
      | ~ p(X3,X2) ),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_49,negated_conjecture,
    ( ~ p(X0,sK0(X1))
    | ~ p(X2,X0) ),
    inference(cnf_transformation,[],[f12]) ).

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

cnf(c_53,negated_conjecture,
    ( p(X0,sK0(X1))
    | p(X1,X0) ),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_59,plain,
    p(X0,sK0(X1)),
    inference(backward_subsumption_resolution,[status(thm)],[c_53,c_50]) ).

cnf(c_61,plain,
    ~ p(X0,X1),
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_50]) ).

cnf(c_65,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_59,c_61]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN965+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu May  2 20:42:03 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.17  % SZS status Started for theBenchmark.p
% 0.48/1.17  % SZS status Theorem for theBenchmark.p
% 0.48/1.17  
% 0.48/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.17  
% 0.48/1.17  ------  iProver source info
% 0.48/1.17  
% 0.48/1.17  git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.17  git: non_committed_changes: false
% 0.48/1.17  
% 0.48/1.17  ------ Parsing...
% 0.48/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.48/1.17  
% 0.48/1.17  ------ Preprocessing...
% 0.48/1.17  
% 0.48/1.17  % SZS status Theorem for theBenchmark.p
% 0.48/1.17  
% 0.48/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17  
% 0.48/1.17  
%------------------------------------------------------------------------------