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

View Problem - Process Solution

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

% Computer : n032.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:27 EDT 2023

% Result   : Theorem 1.28s 0.99s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   37 (   3 unt;   0 def)
%            Number of atoms       :  171 (   0 equ)
%            Maximal formula atoms :   30 (   4 avg)
%            Number of connectives :  217 (  83   ~;  79   |;  34   &)
%                                         (  10 <=>;   9  =>;   0  <=;   2 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   73 (   2 sgn;  26   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X0,X1] :
    ! [X2] :
      ( ( big_f(X0,X1)
       => ( big_f(X0,X2)
        <=> big_g(X1,X2) ) )
     => ( ( big_f(X0,X1)
        <=> ( big_f(X2,X2)
           => big_g(X2,X2) ) )
       => ( big_g(X0,X1)
        <=> big_g(X2,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_6) ).

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

fof(f3,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ( big_g(X0,X1)
      <~> big_g(X2,X2) )
      & ( big_f(X0,X1)
      <=> ( big_g(X2,X2)
          | ~ big_f(X2,X2) ) )
      & ( ( big_f(X0,X2)
        <=> big_g(X1,X2) )
        | ~ big_f(X0,X1) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ( big_g(X0,X1)
      <~> big_g(X2,X2) )
      & ( big_f(X0,X1)
      <=> ( big_g(X2,X2)
          | ~ big_f(X2,X2) ) )
      & ( ( big_f(X0,X2)
        <=> big_g(X1,X2) )
        | ~ big_f(X0,X1) ) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ( ~ big_g(X2,X2)
        | ~ big_g(X0,X1) )
      & ( big_g(X2,X2)
        | big_g(X0,X1) )
      & ( big_f(X0,X1)
        | ( ~ big_g(X2,X2)
          & big_f(X2,X2) ) )
      & ( big_g(X2,X2)
        | ~ big_f(X2,X2)
        | ~ big_f(X0,X1) )
      & ( ( ( big_f(X0,X2)
            | ~ big_g(X1,X2) )
          & ( big_g(X1,X2)
            | ~ big_f(X0,X2) ) )
        | ~ big_f(X0,X1) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f6,plain,
    ! [X0,X1] :
    ? [X2] :
      ( ( ~ big_g(X2,X2)
        | ~ big_g(X0,X1) )
      & ( big_g(X2,X2)
        | big_g(X0,X1) )
      & ( big_f(X0,X1)
        | ( ~ big_g(X2,X2)
          & big_f(X2,X2) ) )
      & ( big_g(X2,X2)
        | ~ big_f(X2,X2)
        | ~ big_f(X0,X1) )
      & ( ( ( big_f(X0,X2)
            | ~ big_g(X1,X2) )
          & ( big_g(X1,X2)
            | ~ big_f(X0,X2) ) )
        | ~ big_f(X0,X1) ) ),
    inference(flattening,[],[f5]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ~ big_g(X2,X2)
            | ~ big_g(X0,X1) )
          & ( big_g(X2,X2)
            | big_g(X0,X1) )
          & ( big_f(X0,X1)
            | ( ~ big_g(X2,X2)
              & big_f(X2,X2) ) )
          & ( big_g(X2,X2)
            | ~ big_f(X2,X2)
            | ~ big_f(X0,X1) )
          & ( ( ( big_f(X0,X2)
                | ~ big_g(X1,X2) )
              & ( big_g(X1,X2)
                | ~ big_f(X0,X2) ) )
            | ~ big_f(X0,X1) ) )
     => ( ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
          | ~ big_g(X0,X1) )
        & ( big_g(sK0(X0,X1),sK0(X0,X1))
          | big_g(X0,X1) )
        & ( big_f(X0,X1)
          | ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
            & big_f(sK0(X0,X1),sK0(X0,X1)) ) )
        & ( big_g(sK0(X0,X1),sK0(X0,X1))
          | ~ big_f(sK0(X0,X1),sK0(X0,X1))
          | ~ big_f(X0,X1) )
        & ( ( ( big_f(X0,sK0(X0,X1))
              | ~ big_g(X1,sK0(X0,X1)) )
            & ( big_g(X1,sK0(X0,X1))
              | ~ big_f(X0,sK0(X0,X1)) ) )
          | ~ big_f(X0,X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
        | ~ big_g(X0,X1) )
      & ( big_g(sK0(X0,X1),sK0(X0,X1))
        | big_g(X0,X1) )
      & ( big_f(X0,X1)
        | ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
          & big_f(sK0(X0,X1),sK0(X0,X1)) ) )
      & ( big_g(sK0(X0,X1),sK0(X0,X1))
        | ~ big_f(sK0(X0,X1),sK0(X0,X1))
        | ~ big_f(X0,X1) )
      & ( ( ( big_f(X0,sK0(X0,X1))
            | ~ big_g(X1,sK0(X0,X1)) )
          & ( big_g(X1,sK0(X0,X1))
            | ~ big_f(X0,sK0(X0,X1)) ) )
        | ~ big_f(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( big_g(X1,sK0(X0,X1))
      | ~ big_f(X0,sK0(X0,X1))
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( big_f(X0,sK0(X0,X1))
      | ~ big_g(X1,sK0(X0,X1))
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( big_g(sK0(X0,X1),sK0(X0,X1))
      | ~ big_f(sK0(X0,X1),sK0(X0,X1))
      | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | ~ big_g(sK0(X0,X1),sK0(X0,X1)) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( big_g(sK0(X0,X1),sK0(X0,X1))
      | big_g(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
      | ~ big_g(X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_49,negated_conjecture,
    ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
    | ~ big_g(X0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_50,negated_conjecture,
    ( big_g(sK0(X0,X1),sK0(X0,X1))
    | big_g(X0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

cnf(c_51,negated_conjecture,
    ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
    | big_f(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

cnf(c_53,negated_conjecture,
    ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
    | ~ big_f(X0,X1)
    | big_g(sK0(X0,X1),sK0(X0,X1)) ),
    inference(cnf_transformation,[],[f11]) ).

cnf(c_54,negated_conjecture,
    ( ~ big_g(X0,sK0(X1,X0))
    | ~ big_f(X1,X0)
    | big_f(X1,sK0(X1,X0)) ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_55,negated_conjecture,
    ( ~ big_f(X0,sK0(X0,X1))
    | ~ big_f(X0,X1)
    | big_g(X1,sK0(X0,X1)) ),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_63,plain,
    ( ~ big_g(X0,X1)
    | ~ big_g(sK0(X0,X1),sK0(X0,X1)) ),
    inference(prop_impl_just,[status(thm)],[c_49]) ).

cnf(c_64,plain,
    ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
    | ~ big_g(X0,X1) ),
    inference(renaming,[status(thm)],[c_63]) ).

cnf(c_67,plain,
    ( big_g(X0,X1)
    | big_f(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_50,c_51]) ).

cnf(c_90,negated_conjecture,
    ( ~ big_f(sK0(X0,X1),sK0(X0,X1))
    | ~ big_g(X0,X1)
    | ~ big_f(X0,X1) ),
    inference(bin_hyper_res,[status(thm)],[c_53,c_64]) ).

cnf(c_143,plain,
    ( big_g(sK0(X0,X1),sK0(X0,X1))
    | big_f(sK0(X0,X1),sK0(X0,X1)) ),
    inference(instantiation,[status(thm)],[c_67]) ).

cnf(c_250,negated_conjecture,
    ( ~ big_g(X0,X1)
    | ~ big_f(X0,X1) ),
    inference(global_subsumption_just,[status(thm)],[c_90,c_49,c_53,c_143]) ).

cnf(c_337,plain,
    ( ~ big_f(X0,X1)
    | big_f(X0,sK0(X0,X1))
    | big_f(X1,sK0(X0,X1)) ),
    inference(superposition,[status(thm)],[c_67,c_54]) ).

cnf(c_349,plain,
    ( ~ big_g(X0,X1)
    | big_f(sK0(X0,X1),sK0(X0,X1)) ),
    inference(superposition,[status(thm)],[c_67,c_49]) ).

cnf(c_351,plain,
    ( ~ big_f(X0,X1)
    | big_f(X0,sK0(X0,X1))
    | big_f(X1,sK0(X0,X1)) ),
    inference(superposition,[status(thm)],[c_67,c_54]) ).

cnf(c_400,plain,
    ( ~ big_f(X0,X0)
    | big_f(X0,sK0(X0,X0)) ),
    inference(equality_factoring,[status(thm)],[c_337]) ).

cnf(c_418,plain,
    ( ~ big_f(X0,X0)
    | big_f(X0,sK0(X0,X0)) ),
    inference(equality_factoring,[status(thm)],[c_351]) ).

cnf(c_508,plain,
    ( ~ big_f(X0,X0)
    | big_g(X0,sK0(X0,X0)) ),
    inference(superposition,[status(thm)],[c_400,c_55]) ).

cnf(c_518,plain,
    ( ~ big_f(X0,X0)
    | big_g(X0,sK0(X0,X0)) ),
    inference(superposition,[status(thm)],[c_418,c_55]) ).

cnf(c_525,plain,
    ( ~ big_f(X0,sK0(X0,X0))
    | ~ big_f(X0,X0) ),
    inference(superposition,[status(thm)],[c_508,c_250]) ).

cnf(c_530,plain,
    ~ big_f(X0,X0),
    inference(global_subsumption_just,[status(thm)],[c_518,c_400,c_525]) ).

cnf(c_533,plain,
    ~ big_g(X0,X1),
    inference(backward_subsumption_resolution,[status(thm)],[c_349,c_530]) ).

cnf(c_535,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_533]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : SYN334+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.09  % Command  : run_iprover %s %d THM
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 300
% 0.09/0.28  % DateTime : Sat Aug 26 18:55:44 EDT 2023
% 0.09/0.28  % CPUTime  : 
% 0.12/0.36  Running first-order theorem proving
% 0.12/0.36  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.28/0.99  % SZS status Started for theBenchmark.p
% 1.28/0.99  % SZS status Theorem for theBenchmark.p
% 1.28/0.99  
% 1.28/0.99  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.28/0.99  
% 1.28/0.99  ------  iProver source info
% 1.28/0.99  
% 1.28/0.99  git: date: 2023-05-31 18:12:56 +0000
% 1.28/0.99  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.28/0.99  git: non_committed_changes: false
% 1.28/0.99  git: last_make_outside_of_git: false
% 1.28/0.99  
% 1.28/0.99  ------ Parsing...
% 1.28/0.99  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.28/0.99  
% 1.28/0.99  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 1.28/0.99  
% 1.28/0.99  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.28/0.99  ------ Proving...
% 1.28/0.99  ------ Problem Properties 
% 1.28/0.99  
% 1.28/0.99  
% 1.28/0.99  clauses                                 7
% 1.28/0.99  conjectures                             6
% 1.28/0.99  EPR                                     1
% 1.28/0.99  Horn                                    4
% 1.28/0.99  unary                                   0
% 1.28/0.99  binary                                  4
% 1.28/0.99  lits                                    17
% 1.28/0.99  lits eq                                 0
% 1.28/0.99  fd_pure                                 0
% 1.28/0.99  fd_pseudo                               0
% 1.28/0.99  fd_cond                                 0
% 1.28/0.99  fd_pseudo_cond                          0
% 1.28/0.99  AC symbols                              0
% 1.28/0.99  
% 1.28/0.99  ------ Schedule dynamic 5 is on 
% 1.28/0.99  
% 1.28/0.99  ------ no equalities: superposition off 
% 1.28/0.99  
% 1.28/0.99  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.28/0.99  
% 1.28/0.99  
% 1.28/0.99  ------ 
% 1.28/0.99  Current options:
% 1.28/0.99  ------ 
% 1.28/0.99  
% 1.28/0.99  
% 1.28/0.99  
% 1.28/0.99  
% 1.28/0.99  ------ Proving...
% 1.28/0.99  
% 1.28/0.99  
% 1.28/0.99  % SZS status Theorem for theBenchmark.p
% 1.28/0.99  
% 1.28/0.99  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.28/0.99  
% 1.28/0.99  
%------------------------------------------------------------------------------