TSTP Solution File: SYN333+1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n003.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 May  3 03:30:09 EDT 2024

% Result   : Theorem 0.46s 1.17s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  104 (  43   ~;  33   |;  23   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   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   :   43 (   6 sgn  18   !;   7   ?)

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_52,negated_conjecture,
    big_f(X0,X1),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_56,negated_conjecture,
    big_f(X0,X1),
    inference(global_subsumption_just,[status(thm)],[c_51,c_52]) ).

cnf(c_60,plain,
    ( ~ big_f(X0,sK0(X1,X0))
    | big_g(X1,X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_56]) ).

cnf(c_61,plain,
    ( ~ big_g(sK0(X0,X1),sK0(X0,X1))
    | ~ big_g(X0,sK0(X0,X1))
    | ~ big_f(X1,sK0(X0,X1)) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_56]) ).

cnf(c_66,plain,
    big_g(X0,X1),
    inference(forward_subsumption_resolution,[status(thm)],[c_60,c_56]) ).

cnf(c_71,plain,
    ( ~ big_g(X0,sK0(X0,X1))
    | ~ big_f(X1,sK0(X0,X1)) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_61,c_66]) ).

cnf(c_75,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_71,c_56,c_66]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN333+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13  % Command  : run_iprover %s %d THM
% 0.11/0.34  % Computer : n003.cluster.edu
% 0.11/0.34  % Model    : x86_64 x86_64
% 0.11/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34  % Memory   : 8042.1875MB
% 0.11/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34  % CPULimit : 300
% 0.11/0.34  % WCLimit  : 300
% 0.11/0.34  % DateTime : Thu May  2 20:54:05 EDT 2024
% 0.11/0.34  % CPUTime  : 
% 0.18/0.46  Running first-order theorem proving
% 0.18/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.46/1.17  % SZS status Started for theBenchmark.p
% 0.46/1.17  % SZS status Theorem for theBenchmark.p
% 0.46/1.17  
% 0.46/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.17  
% 0.46/1.17  ------  iProver source info
% 0.46/1.17  
% 0.46/1.17  git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.17  git: non_committed_changes: false
% 0.46/1.17  
% 0.46/1.17  ------ Parsing...
% 0.46/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.46/1.17  
% 0.46/1.17  ------ Preprocessing...
% 0.46/1.17  
% 0.46/1.17  % SZS status Theorem for theBenchmark.p
% 0.46/1.17  
% 0.46/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.17  
% 0.46/1.17  
%------------------------------------------------------------------------------