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

% Computer : n002.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:16:47 EDT 2023

% Result   : Unsatisfiable 0.14s 0.38s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  11 unt;   0 def)
%            Number of atoms       :   37 (  20 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   25 (  12   ~;  11   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    8 (;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    ! [U,V] : k(join(U,V)) = meet(k(U),k(V)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,axiom,
    k(n0) = n1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f18,axiom,
    ! [U,V] : f(meet(U,V)) = join(f(U),f(V)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f19,axiom,
    f(n1) = n0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f20,negated_conjecture,
    ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
    | f(k(n0)) != n0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f35,plain,
    ! [X0,X1] : k(join(X0,X1)) = meet(k(X0),k(X1)),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f37,plain,
    k(n0) = n1,
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f39,plain,
    ! [X0,X1] : f(meet(X0,X1)) = join(f(X0),f(X1)),
    inference(cnf_transformation,[status(esa)],[f18]) ).

fof(f40,plain,
    f(n1) = n0,
    inference(cnf_transformation,[status(esa)],[f19]) ).

fof(f41,plain,
    ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
    | f(k(n0)) != n0 ),
    inference(cnf_transformation,[status(esa)],[f20]) ).

fof(f42,plain,
    ( spl0_0
  <=> f(k(join(aa,bb))) = join(f(k(aa)),f(k(bb))) ),
    introduced(split_symbol_definition) ).

fof(f44,plain,
    ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f42]) ).

fof(f45,plain,
    ( spl0_1
  <=> f(k(n0)) = n0 ),
    introduced(split_symbol_definition) ).

fof(f47,plain,
    ( f(k(n0)) != n0
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f45]) ).

fof(f48,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f41,f42,f45]) ).

fof(f49,plain,
    ( f(k(join(aa,bb))) != f(meet(k(aa),k(bb)))
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f39,f44]) ).

fof(f50,plain,
    ( f(k(join(aa,bb))) != f(k(join(aa,bb)))
    | spl0_0 ),
    inference(forward_demodulation,[status(thm)],[f35,f49]) ).

fof(f51,plain,
    ( $false
    | spl0_0 ),
    inference(trivial_equality_resolution,[status(esa)],[f50]) ).

fof(f52,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f51]) ).

fof(f53,plain,
    ( f(n1) != n0
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f37,f47]) ).

fof(f54,plain,
    ( n0 != n0
    | spl0_1 ),
    inference(forward_demodulation,[status(thm)],[f40,f53]) ).

fof(f55,plain,
    ( $false
    | spl0_1 ),
    inference(trivial_equality_resolution,[status(esa)],[f54]) ).

fof(f56,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f55]) ).

fof(f57,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f48,f52,f56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LAT035-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue May 30 09:41:28 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % Drodi V3.5.1
% 0.14/0.38  % Refutation found
% 0.14/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.44  % Elapsed time: 0.084634 seconds
% 0.20/0.44  % CPU time: 0.039334 seconds
% 0.20/0.44  % Memory used: 4.772 MB
%------------------------------------------------------------------------------