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

View Problem - Process Solution

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

% Computer : n027.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:14:59 EDT 2023

% Result   : Theorem 0.64s 1.17s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   6 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   6   ~;   0   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   10 (   1 sgn;   3   !;   6   ?)

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

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

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

fof(f4,plain,
    ( ? [X1] : p(X1)
   => p(sK0) ),
    introduced(choice_axiom,[]) ).

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

fof(f6,plain,
    p(sK0),
    inference(cnf_transformation,[],[f5]) ).

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

cnf(c_49,negated_conjecture,
    ~ p(X0),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_50,negated_conjecture,
    p(sK0),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_51,plain,
    ~ p(sK0),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_52,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_51,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN971+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n027.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:35:50 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.64/1.17  % SZS status Started for theBenchmark.p
% 0.64/1.17  % SZS status Theorem for theBenchmark.p
% 0.64/1.17  
% 0.64/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.64/1.17  
% 0.64/1.17  ------  iProver source info
% 0.64/1.17  
% 0.64/1.17  git: date: 2023-05-31 18:12:56 +0000
% 0.64/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.64/1.17  git: non_committed_changes: false
% 0.64/1.17  git: last_make_outside_of_git: false
% 0.64/1.17  
% 0.64/1.17  ------ Parsing...
% 0.64/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_horn
% 0.64/1.17  
% 0.64/1.17  
% 0.64/1.17  ------ Preprocessing...
% 0.64/1.17  
% 0.64/1.17  % SZS status Theorem for theBenchmark.p
% 0.64/1.17  
% 0.64/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.64/1.17  
% 0.64/1.17  
%------------------------------------------------------------------------------