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

% Computer : n005.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:38 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( big_r(a,b)
      & ! [X,Y] :
          ( big_r(X,Y)
         => ( big_r(Y,X)
            & big_q(X,Y) ) )
      & ! [U,V] :
          ( big_q(U,V)
         => big_q(U,U) ) )
   => ( big_q(a,a)
      & big_q(b,b) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ( big_r(a,b)
        & ! [X,Y] :
            ( big_r(X,Y)
           => ( big_r(Y,X)
              & big_q(X,Y) ) )
        & ! [U,V] :
            ( big_q(U,V)
           => big_q(U,U) ) )
     => ( big_q(a,a)
        & big_q(b,b) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( big_r(a,b)
    & ! [X,Y] :
        ( ~ big_r(X,Y)
        | ( big_r(Y,X)
          & big_q(X,Y) ) )
    & ! [U,V] :
        ( ~ big_q(U,V)
        | big_q(U,U) )
    & ( ~ big_q(a,a)
      | ~ big_q(b,b) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( big_r(a,b)
    & ! [X,Y] :
        ( ~ big_r(X,Y)
        | ( big_r(Y,X)
          & big_q(X,Y) ) )
    & ! [U] :
        ( ! [V] : ~ big_q(U,V)
        | big_q(U,U) )
    & ( ~ big_q(a,a)
      | ~ big_q(b,b) ) ),
    inference(miniscoping,[status(esa)],[f3]) ).

fof(f5,plain,
    big_r(a,b),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( ~ big_r(X0,X1)
      | big_r(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ~ big_r(X0,X1)
      | big_q(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ~ big_q(X0,X1)
      | big_q(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f9,plain,
    ( ~ big_q(a,a)
    | ~ big_q(b,b) ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f10,plain,
    ( spl0_0
  <=> big_q(a,a) ),
    introduced(split_symbol_definition) ).

fof(f12,plain,
    ( ~ big_q(a,a)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f10]) ).

fof(f13,plain,
    ( spl0_1
  <=> big_q(b,b) ),
    introduced(split_symbol_definition) ).

fof(f15,plain,
    ( ~ big_q(b,b)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f13]) ).

fof(f16,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f9,f10,f13]) ).

fof(f17,plain,
    big_r(b,a),
    inference(resolution,[status(thm)],[f6,f5]) ).

fof(f19,plain,
    big_q(b,a),
    inference(resolution,[status(thm)],[f7,f17]) ).

fof(f20,plain,
    big_q(a,b),
    inference(resolution,[status(thm)],[f7,f5]) ).

fof(f21,plain,
    big_q(b,b),
    inference(resolution,[status(thm)],[f8,f19]) ).

fof(f22,plain,
    big_q(a,a),
    inference(resolution,[status(thm)],[f20,f8]) ).

fof(f25,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f22]) ).

fof(f26,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f25]) ).

fof(f27,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f15,f21]) ).

fof(f28,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f27]) ).

fof(f29,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f16,f26,f28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN356+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n005.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 10:26:36 EDT 2023
% 0.13/0.34  % 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.19/0.57  % Elapsed time: 0.011446 seconds
% 0.19/0.57  % CPU time: 0.025929 seconds
% 0.19/0.57  % Memory used: 7.001 MB
%------------------------------------------------------------------------------