%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : COM004-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% 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 : Tue Apr 30 20:14:00 EDT 2024

% Result   : Unsatisfiable 0.13s 0.35s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   32 (  19 unt;   0 def)
%            Number of atoms       :   57 (   4 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   50 (  25   ~;  23   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   29 (  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X,Y,C,D,P,Q] :
      ( failure_node(parent_of(X,Y),or(C,D))
      | ~ failure_node(X,or(C,P))
      | ~ failure_node(Y,or(D,Q))
      | ~ contradictory(P,Q)
      | ~ siblings(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X] : contradictory(X,negate(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X] : siblings(left_child_of(X),right_child_of(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,hypothesis,
    failure_node(n_left,or(empty,atom)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,hypothesis,
    failure_node(n_right,or(empty,negate(atom))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,hypothesis,
    n_left = left_child_of(n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,hypothesis,
    n_right = right_child_of(n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ! [Z] : ~ failure_node(Z,or(empty,empty)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,plain,
    ! [X,Y] :
      ( ! [P,Q] :
          ( ! [D] :
              ( ! [C] :
                  ( failure_node(parent_of(X,Y),or(C,D))
                  | ~ failure_node(X,or(C,P)) )
              | ~ failure_node(Y,or(D,Q)) )
          | ~ contradictory(P,Q) )
      | ~ siblings(X,Y) ),
    inference(miniscoping,[status(esa)],[f1]) ).

fof(f11,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( failure_node(parent_of(X0,X1),or(X2,X3))
      | ~ failure_node(X0,or(X2,X4))
      | ~ failure_node(X1,or(X3,X5))
      | ~ contradictory(X4,X5)
      | ~ siblings(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f13,plain,
    ! [X0] : contradictory(X0,negate(X0)),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f14,plain,
    ! [X0] : siblings(left_child_of(X0),right_child_of(X0)),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f15,plain,
    failure_node(n_left,or(empty,atom)),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f16,plain,
    failure_node(n_right,or(empty,negate(atom))),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f17,plain,
    n_left = left_child_of(n),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f18,plain,
    n_right = right_child_of(n),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f19,plain,
    ! [X0] : ~ failure_node(X0,or(empty,empty)),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f20,plain,
    siblings(n_left,right_child_of(n)),
    inference(paramodulation,[status(thm)],[f17,f14]) ).

fof(f21,plain,
    siblings(n_left,n_right),
    inference(forward_demodulation,[status(thm)],[f18,f20]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( failure_node(parent_of(X0,n_right),or(X1,empty))
      | ~ failure_node(X0,or(X1,X2))
      | ~ contradictory(X2,negate(atom))
      | ~ siblings(X0,n_right) ),
    inference(resolution,[status(thm)],[f16,f11]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( failure_node(parent_of(n_left,n_right),or(X0,empty))
      | ~ failure_node(n_left,or(X0,X1))
      | ~ contradictory(X1,negate(atom)) ),
    inference(resolution,[status(thm)],[f25,f21]) ).

fof(f27,plain,
    ( spl0_0
  <=> failure_node(parent_of(n_left,n_right),or(empty,empty)) ),
    introduced(split_symbol_definition) ).

fof(f28,plain,
    ( failure_node(parent_of(n_left,n_right),or(empty,empty))
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f27]) ).

fof(f30,plain,
    ( spl0_1
  <=> contradictory(atom,negate(atom)) ),
    introduced(split_symbol_definition) ).

fof(f32,plain,
    ( ~ contradictory(atom,negate(atom))
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f30]) ).

fof(f33,plain,
    ( failure_node(parent_of(n_left,n_right),or(empty,empty))
    | ~ contradictory(atom,negate(atom)) ),
    inference(resolution,[status(thm)],[f26,f15]) ).

fof(f34,plain,
    ( spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f33,f27,f30]) ).

fof(f35,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f32,f13]) ).

fof(f36,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f35]) ).

fof(f37,plain,
    ( $false
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f28,f19]) ).

fof(f38,plain,
    ~ spl0_0,
    inference(contradiction_clause,[status(thm)],[f37]) ).

fof(f39,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f34,f36,f38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COM004-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue Apr 30 01:11:33 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 0.13/0.35  % Refutation found
% 0.13/0.35  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37  % Elapsed time: 0.023318 seconds
% 0.13/0.37  % CPU time: 0.030522 seconds
% 0.13/0.37  % Total memory used: 7.006 MB
% 0.13/0.37  % Net memory used: 6.867 MB
%------------------------------------------------------------------------------