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

View Problem - Process Solution

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

% Computer : n029.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:46 EDT 2023

% Result   : Theorem 1.50s 1.17s
% Output   : CNFRefutation 1.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   7 unt;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   71 (  28   ~;  17   |;  15   &)
%                                         (   5 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   39 (   3 sgn;  18   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X0] :
      ! [X1] :
        ( big_p(X1)
      <=> big_p(X0) )
   => ( ! [X0] : ~ big_p(X0)
      | ! [X0] : big_p(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2127) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] :
        ! [X1] :
          ( big_p(X1)
        <=> big_p(X0) )
     => ( ! [X0] : ~ big_p(X0)
        | ! [X0] : big_p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ? [X0] :
        ! [X1] :
          ( big_p(X1)
        <=> big_p(X0) )
     => ( ! [X2] : ~ big_p(X2)
        | ! [X3] : big_p(X3) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X2] : big_p(X2)
    & ? [X3] : ~ big_p(X3)
    & ? [X0] :
      ! [X1] :
        ( big_p(X1)
      <=> big_p(X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X2] : big_p(X2)
    & ? [X3] : ~ big_p(X3)
    & ? [X0] :
      ! [X1] :
        ( big_p(X1)
      <=> big_p(X0) ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ? [X2] : big_p(X2)
    & ? [X3] : ~ big_p(X3)
    & ? [X0] :
      ! [X1] :
        ( ( big_p(X1)
          | ~ big_p(X0) )
        & ( big_p(X0)
          | ~ big_p(X1) ) ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f7,plain,
    ( ? [X0] : big_p(X0)
    & ? [X1] : ~ big_p(X1)
    & ? [X2] :
      ! [X3] :
        ( ( big_p(X3)
          | ~ big_p(X2) )
        & ( big_p(X2)
          | ~ big_p(X3) ) ) ),
    inference(rectify,[],[f6]) ).

fof(f8,plain,
    ( ? [X0] : big_p(X0)
   => big_p(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X1] : ~ big_p(X1)
   => ~ big_p(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ( ? [X2] :
      ! [X3] :
        ( ( big_p(X3)
          | ~ big_p(X2) )
        & ( big_p(X2)
          | ~ big_p(X3) ) )
   => ! [X3] :
        ( ( big_p(X3)
          | ~ big_p(sK2) )
        & ( big_p(sK2)
          | ~ big_p(X3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ( big_p(sK0)
    & ~ big_p(sK1)
    & ! [X3] :
        ( ( big_p(X3)
          | ~ big_p(sK2) )
        & ( big_p(sK2)
          | ~ big_p(X3) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).

fof(f12,plain,
    ! [X3] :
      ( big_p(sK2)
      | ~ big_p(X3) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f13,plain,
    ! [X3] :
      ( big_p(X3)
      | ~ big_p(sK2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f14,plain,
    ~ big_p(sK1),
    inference(cnf_transformation,[],[f11]) ).

fof(f15,plain,
    big_p(sK0),
    inference(cnf_transformation,[],[f11]) ).

cnf(c_49,negated_conjecture,
    big_p(sK0),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_50,negated_conjecture,
    ~ big_p(sK1),
    inference(cnf_transformation,[],[f14]) ).

cnf(c_51,negated_conjecture,
    ( ~ big_p(sK2)
    | big_p(X0) ),
    inference(cnf_transformation,[],[f13]) ).

cnf(c_52,negated_conjecture,
    ( ~ big_p(X0)
    | big_p(sK2) ),
    inference(cnf_transformation,[],[f12]) ).

cnf(c_65,plain,
    big_p(sK2),
    inference(resolution,[status(thm)],[c_52,c_49]) ).

cnf(c_66,plain,
    big_p(X0),
    inference(resolution,[status(thm)],[c_65,c_51]) ).

cnf(c_68,plain,
    $false,
    inference(resolution,[status(thm)],[c_66,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN376+1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sat Aug 26 18:52:55 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.50/1.17  % SZS status Started for theBenchmark.p
% 1.50/1.17  % SZS status Theorem for theBenchmark.p
% 1.50/1.17  
% 1.50/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.50/1.17  
% 1.50/1.17  ------  iProver source info
% 1.50/1.17  
% 1.50/1.17  git: date: 2023-05-31 18:12:56 +0000
% 1.50/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.50/1.17  git: non_committed_changes: false
% 1.50/1.17  git: last_make_outside_of_git: false
% 1.50/1.17  
% 1.50/1.17  ------ Parsing...
% 1.50/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_horn
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.50/1.17  
% 1.50/1.17  ------ Preprocessing...------  preprocesses with Option_epr_horn
% 1.50/1.17   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.50/1.17  ------ Proving...
% 1.50/1.17  ------ Problem Properties 
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  clauses                                 4
% 1.50/1.17  conjectures                             4
% 1.50/1.17  EPR                                     4
% 1.50/1.17  Horn                                    4
% 1.50/1.17  unary                                   2
% 1.50/1.17  binary                                  2
% 1.50/1.17  lits                                    6
% 1.50/1.17  lits eq                                 0
% 1.50/1.17  fd_pure                                 0
% 1.50/1.17  fd_pseudo                               0
% 1.50/1.17  fd_cond                                 0
% 1.50/1.17  fd_pseudo_cond                          0
% 1.50/1.17  AC symbols                              0
% 1.50/1.17  
% 1.50/1.17  ------ Schedule EPR Horn non eq is on
% 1.50/1.17  
% 1.50/1.17  ------ no equalities: superposition off 
% 1.50/1.17  
% 1.50/1.17  ------ Option_epr_horn Time Limit: Unbounded
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  ------ 
% 1.50/1.17  Current options:
% 1.50/1.17  ------ 
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  ------ Proving...
% 1.50/1.17  
% 1.50/1.17  
% 1.50/1.17  % SZS status Theorem for theBenchmark.p
% 1.50/1.17  
% 1.50/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.50/1.17  
% 1.50/1.17  
%------------------------------------------------------------------------------