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

View Problem - Process Solution

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

% Computer : n009.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:05:02 EDT 2023

% Result   : Theorem 1.65s 1.19s
% Output   : CNFRefutation 1.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  13 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   38 (  21   ~;  11   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   34 (   3 sgn;  20   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
    ? [X1] : big_f(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel36_1) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ( big_g(X0,X1)
        | big_f(X0,X1) )
     => ! [X2] :
          ( ( big_g(X1,X2)
            | big_f(X1,X2) )
         => big_h(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel36_3) ).

fof(f4,conjecture,
    ! [X0] :
    ? [X1] : big_h(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel36) ).

fof(f5,negated_conjecture,
    ~ ! [X0] :
      ? [X1] : big_h(X0,X1),
    inference(negated_conjecture,[],[f4]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( big_h(X0,X2)
          | ( ~ big_g(X1,X2)
            & ~ big_f(X1,X2) ) )
      | ( ~ big_g(X0,X1)
        & ~ big_f(X0,X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f7,plain,
    ? [X0] :
    ! [X1] : ~ big_h(X0,X1),
    inference(ennf_transformation,[],[f5]) ).

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

fof(f9,plain,
    ! [X0] : big_f(X0,sK0(X0)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f8]) ).

fof(f12,plain,
    ( ? [X0] :
      ! [X1] : ~ big_h(X0,X1)
   => ! [X1] : ~ big_h(sK2,X1) ),
    introduced(choice_axiom,[]) ).

fof(f13,plain,
    ! [X1] : ~ big_h(sK2,X1),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f7,f12]) ).

fof(f14,plain,
    ! [X0] : big_f(X0,sK0(X0)),
    inference(cnf_transformation,[],[f9]) ).

fof(f16,plain,
    ! [X2,X0,X1] :
      ( big_h(X0,X2)
      | ~ big_f(X1,X2)
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f20,plain,
    ! [X1] : ~ big_h(sK2,X1),
    inference(cnf_transformation,[],[f13]) ).

cnf(c_49,plain,
    big_f(X0,sK0(X0)),
    inference(cnf_transformation,[],[f14]) ).

cnf(c_54,plain,
    ( ~ big_f(X0,X1)
    | ~ big_f(X1,X2)
    | big_h(X0,X2) ),
    inference(cnf_transformation,[],[f16]) ).

cnf(c_55,negated_conjecture,
    ~ big_h(sK2,X0),
    inference(cnf_transformation,[],[f20]) ).

cnf(c_58,plain,
    big_f(sK2,sK0(sK2)),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_91,plain,
    ( ~ big_f(X0,X1)
    | ~ big_f(sK2,X0) ),
    inference(resolution,[status(thm)],[c_54,c_55]) ).

cnf(c_149,plain,
    ( ~ big_f(sK0(sK2),X0)
    | ~ big_f(sK2,sK0(sK2)) ),
    inference(instantiation,[status(thm)],[c_91]) ).

cnf(c_165,plain,
    ( ~ big_f(sK0(sK2),sK0(sK0(sK2)))
    | ~ big_f(sK2,sK0(sK2)) ),
    inference(instantiation,[status(thm)],[c_149]) ).

cnf(c_166,plain,
    big_f(sK0(sK2),sK0(sK0(sK2))),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_167,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_166,c_165,c_58]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN065+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n009.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 21:49:50 EDT 2023
% 0.12/0.34  % 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 --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.65/1.19  % SZS status Started for theBenchmark.p
% 1.65/1.19  % SZS status Theorem for theBenchmark.p
% 1.65/1.19  
% 1.65/1.19  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.65/1.19  
% 1.65/1.19  ------  iProver source info
% 1.65/1.19  
% 1.65/1.19  git: date: 2023-05-31 18:12:56 +0000
% 1.65/1.19  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.65/1.19  git: non_committed_changes: false
% 1.65/1.19  git: last_make_outside_of_git: false
% 1.65/1.19  
% 1.65/1.19  ------ Parsing...
% 1.65/1.19  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.65/1.19  
% 1.65/1.19  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe:1:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.65/1.19  
% 1.65/1.19  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.65/1.19  ------ Proving...
% 1.65/1.19  ------ Problem Properties 
% 1.65/1.19  
% 1.65/1.19  
% 1.65/1.19  clauses                                 6
% 1.65/1.19  conjectures                             0
% 1.65/1.19  EPR                                     4
% 1.65/1.19  Horn                                    6
% 1.65/1.19  unary                                   2
% 1.65/1.19  binary                                  4
% 1.65/1.19  lits                                    10
% 1.65/1.19  lits eq                                 0
% 1.65/1.19  fd_pure                                 0
% 1.65/1.19  fd_pseudo                               0
% 1.65/1.19  fd_cond                                 0
% 1.65/1.19  fd_pseudo_cond                          0
% 1.65/1.19  AC symbols                              0
% 1.65/1.19  
% 1.65/1.19  ------ Schedule dynamic 5 is on 
% 1.65/1.19  
% 1.65/1.19  ------ no conjectures: strip conj schedule 
% 1.65/1.19  
% 1.65/1.19  ------ no equalities: superposition off 
% 1.65/1.19  
% 1.65/1.19  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.65/1.19  
% 1.65/1.19  
% 1.65/1.19  ------ 
% 1.65/1.19  Current options:
% 1.65/1.19  ------ 
% 1.65/1.19  
% 1.65/1.19  
% 1.65/1.19  
% 1.65/1.19  
% 1.65/1.19  ------ Proving...
% 1.65/1.19  
% 1.65/1.19  
% 1.65/1.19  % SZS status Theorem for theBenchmark.p
% 1.65/1.19  
% 1.65/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/1.19  
% 1.65/1.19  
%------------------------------------------------------------------------------