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

% Computer : n031.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:51:14 EDT 2024

% Result   : Unsatisfiable 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :   56 (  24 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   55 (  28   ~;  23   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ( a = b
    | c = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ( a = c
    | b = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    a != d,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    b != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,plain,
    ( a = b
    | c = d ),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f6,plain,
    ( a = c
    | b = d ),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f7,plain,
    a != d,
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f8,plain,
    b != c,
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f9,plain,
    ( spl0_0
  <=> a = b ),
    introduced(split_symbol_definition) ).

fof(f10,plain,
    ( a = b
    | ~ spl0_0 ),
    inference(component_clause,[status(thm)],[f9]) ).

fof(f12,plain,
    ( spl0_1
  <=> c = d ),
    introduced(split_symbol_definition) ).

fof(f13,plain,
    ( c = d
    | ~ spl0_1 ),
    inference(component_clause,[status(thm)],[f12]) ).

fof(f15,plain,
    ( spl0_0
    | spl0_1 ),
    inference(split_clause,[status(thm)],[f5,f9,f12]) ).

fof(f16,plain,
    ( spl0_2
  <=> a = c ),
    introduced(split_symbol_definition) ).

fof(f17,plain,
    ( a = c
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f16]) ).

fof(f19,plain,
    ( spl0_3
  <=> b = d ),
    introduced(split_symbol_definition) ).

fof(f20,plain,
    ( b = d
    | ~ spl0_3 ),
    inference(component_clause,[status(thm)],[f19]) ).

fof(f22,plain,
    ( spl0_2
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f6,f16,f19]) ).

fof(f23,plain,
    ( b != a
    | ~ spl0_2 ),
    inference(backward_demodulation,[status(thm)],[f17,f8]) ).

fof(f24,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f10,f23]) ).

fof(f25,plain,
    ( ~ spl0_2
    | ~ spl0_0 ),
    inference(contradiction_clause,[status(thm)],[f24]) ).

fof(f26,plain,
    ( a != b
    | ~ spl0_3 ),
    inference(backward_demodulation,[status(thm)],[f20,f7]) ).

fof(f27,plain,
    ( c = b
    | ~ spl0_3
    | ~ spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f20,f13]) ).

fof(f28,plain,
    ( $false
    | ~ spl0_3
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f27,f8]) ).

fof(f29,plain,
    ( ~ spl0_3
    | ~ spl0_1 ),
    inference(contradiction_clause,[status(thm)],[f28]) ).

fof(f30,plain,
    ( a != c
    | ~ spl0_1 ),
    inference(backward_demodulation,[status(thm)],[f13,f7]) ).

fof(f31,plain,
    ( ~ spl0_2
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f30,f16,f12]) ).

fof(f32,plain,
    ( ~ spl0_0
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f26,f9,f19]) ).

fof(f33,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f15,f22,f25,f29,f31,f32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN071-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33  % Computer : n031.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Apr 29 22:39:43 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % Drodi V3.6.0
% 0.12/0.34  % Refutation found
% 0.12/0.34  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.34  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.35  % Elapsed time: 0.016411 seconds
% 0.12/0.35  % CPU time: 0.020043 seconds
% 0.12/0.35  % Total memory used: 7.766 MB
% 0.12/0.35  % Net memory used: 7.650 MB
%------------------------------------------------------------------------------