%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SYN331+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n017.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 : Wed May 31 12:46:32 EDT 2023

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :   58 (  14   ~;  16   |;  17   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   30 (;  24   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X,Y] :
    ! [Z] :
      ( big_f(X,Z)
     => ( big_f(Y,Z)
       => ( ( big_f(X,Y)
          <=> big_f(Z,Z) )
         => ( ( big_f(Y,X)
              | big_f(Z,Z) )
           => ( big_f(Z,X)
              | big_f(Z,Y) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ? [X,Y] :
      ! [Z] :
        ( big_f(X,Z)
       => ( big_f(Y,Z)
         => ( ( big_f(X,Y)
            <=> big_f(Z,Z) )
           => ( ( big_f(Y,X)
                | big_f(Z,Z) )
             => ( big_f(Z,X)
                | big_f(Z,Y) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ! [X,Y] :
    ? [Z] :
      ( big_f(X,Z)
      & big_f(Y,Z)
      & ( big_f(X,Y)
      <=> big_f(Z,Z) )
      & ( big_f(Y,X)
        | big_f(Z,Z) )
      & ~ big_f(Z,X)
      & ~ big_f(Z,Y) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ! [X,Y] :
    ? [Z] :
      ( big_f(X,Z)
      & big_f(Y,Z)
      & ( ~ big_f(X,Y)
        | big_f(Z,Z) )
      & ( big_f(X,Y)
        | ~ big_f(Z,Z) )
      & ( big_f(Y,X)
        | big_f(Z,Z) )
      & ~ big_f(Z,X)
      & ~ big_f(Z,Y) ),
    inference(NNF_transformation,[status(esa)],[f3]) ).

fof(f5,plain,
    ! [X,Y] :
      ( big_f(X,sk0_0(Y,X))
      & big_f(Y,sk0_0(Y,X))
      & ( ~ big_f(X,Y)
        | big_f(sk0_0(Y,X),sk0_0(Y,X)) )
      & ( big_f(X,Y)
        | ~ big_f(sk0_0(Y,X),sk0_0(Y,X)) )
      & ( big_f(Y,X)
        | big_f(sk0_0(Y,X),sk0_0(Y,X)) )
      & ~ big_f(sk0_0(Y,X),X)
      & ~ big_f(sk0_0(Y,X),Y) ),
    inference(skolemization,[status(esa)],[f4]) ).

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

fof(f9,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | ~ big_f(sk0_0(X1,X0),sk0_0(X1,X0)) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | big_f(sk0_0(X0,X1),sk0_0(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f12,plain,
    ! [X0,X1] : ~ big_f(sk0_0(X0,X1),X0),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | big_f(X1,X0) ),
    inference(resolution,[status(thm)],[f10,f9]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( big_f(sk0_0(X0,X1),sk0_0(X0,X1))
      | big_f(X1,X0) ),
    inference(resolution,[status(thm)],[f13,f9]) ).

fof(f15,plain,
    ! [X0,X1] : big_f(sk0_0(X0,X1),sk0_0(X0,X1)),
    inference(forward_subsumption_resolution,[status(thm)],[f14,f8]) ).

fof(f18,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(backward_subsumption_resolution,[status(thm)],[f9,f15]) ).

fof(f19,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f12,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN331+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n017.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 : Tue May 30 09:52:40 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % Drodi V3.5.1
% 0.13/0.36  % Refutation found
% 0.13/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36  % Elapsed time: 0.014240 seconds
% 0.13/0.36  % CPU time: 0.022277 seconds
% 0.13/0.36  % Memory used: 1.818 MB
%------------------------------------------------------------------------------