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

View Problem - Process Solution

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

% Computer : n025.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:32 EDT 2023

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

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

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

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

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

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

fof(f6,plain,
    ! [X0,X1] :
      ( big_f(X0,X0)
      | big_f(X0,X1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X2,X0,X1] :
      ( ~ big_f(X1,X2)
      | ~ big_f(X0,X0) ),
    inference(cnf_transformation,[],[f5]) ).

cnf(c_49,negated_conjecture,
    ( ~ big_f(X0,X1)
    | ~ big_f(X2,X2) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_51,negated_conjecture,
    ( big_f(X0,X0)
    | big_f(X0,X1) ),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_52,plain,
    big_f(iProver_bot,iProver_bot),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_53,plain,
    ~ big_f(iProver_bot,iProver_bot),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_54,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_53,c_52]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN343+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n025.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 19:10:53 EDT 2023
% 0.13/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
% 0.51/1.18  % SZS status Started for theBenchmark.p
% 0.51/1.18  % SZS status Theorem for theBenchmark.p
% 0.51/1.18  
% 0.51/1.18  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.51/1.18  
% 0.51/1.18  ------  iProver source info
% 0.51/1.18  
% 0.51/1.18  git: date: 2023-05-31 18:12:56 +0000
% 0.51/1.18  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.51/1.18  git: non_committed_changes: false
% 0.51/1.18  git: last_make_outside_of_git: false
% 0.51/1.18  
% 0.51/1.18  ------ Parsing...
% 0.51/1.18  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.51/1.18  
% 0.51/1.18  ------ Preprocessing...
% 0.51/1.18  
% 0.51/1.18  % SZS status Theorem for theBenchmark.p
% 0.51/1.18  
% 0.51/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.51/1.19  
% 0.51/1.19  
%------------------------------------------------------------------------------