TSTP Solution File: FLD030-1 by Drodi---3.6.0

View Problem - Process Solution

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

% Computer : n016.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:16:24 EDT 2024

% Result   : Unsatisfiable 0.15s 0.33s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (  10 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   33 (  17   ~;  14   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f22,axiom,
    ! [X,Y] :
      ( equalish(X,Y)
      | ~ equalish(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f25,axiom,
    ! [X,Z,Y] :
      ( equalish(multiply(X,Z),multiply(Y,Z))
      | ~ defined(Z)
      | ~ equalish(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f29,hypothesis,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f31,negated_conjecture,
    equalish(a,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f32,negated_conjecture,
    ~ equalish(multiply(d,b),multiply(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f65,plain,
    ! [X0,X1] :
      ( equalish(X0,X1)
      | ~ equalish(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f22]) ).

fof(f70,plain,
    ! [X,Y] :
      ( ! [Z] :
          ( equalish(multiply(X,Z),multiply(Y,Z))
          | ~ defined(Z) )
      | ~ equalish(X,Y) ),
    inference(miniscoping,[status(esa)],[f25]) ).

fof(f71,plain,
    ! [X0,X1,X2] :
      ( equalish(multiply(X0,X1),multiply(X2,X1))
      | ~ defined(X1)
      | ~ equalish(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f70]) ).

fof(f76,plain,
    defined(b),
    inference(cnf_transformation,[status(esa)],[f29]) ).

fof(f78,plain,
    equalish(a,d),
    inference(cnf_transformation,[status(esa)],[f31]) ).

fof(f79,plain,
    ~ equalish(multiply(d,b),multiply(a,b)),
    inference(cnf_transformation,[status(esa)],[f32]) ).

fof(f80,plain,
    ~ equalish(multiply(a,b),multiply(d,b)),
    inference(resolution,[status(thm)],[f65,f79]) ).

fof(f84,plain,
    ( spl0_0
  <=> defined(b) ),
    introduced(split_symbol_definition) ).

fof(f86,plain,
    ( ~ defined(b)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f84]) ).

fof(f87,plain,
    ( spl0_1
  <=> equalish(a,d) ),
    introduced(split_symbol_definition) ).

fof(f89,plain,
    ( ~ equalish(a,d)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f87]) ).

fof(f90,plain,
    ( ~ defined(b)
    | ~ equalish(a,d) ),
    inference(resolution,[status(thm)],[f71,f80]) ).

fof(f91,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f90,f84,f87]) ).

fof(f97,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f89,f78]) ).

fof(f98,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f97]) ).

fof(f99,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f86,f76]) ).

fof(f100,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f99]) ).

fof(f101,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f91,f98,f100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem  : FLD030-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30  % Computer : n016.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Mon Apr 29 23:57:10 EDT 2024
% 0.10/0.30  % CPUTime  : 
% 0.10/0.31  % Drodi V3.6.0
% 0.15/0.33  % Refutation found
% 0.15/0.33  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.33  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.33  % Elapsed time: 0.016463 seconds
% 0.15/0.33  % CPU time: 0.031152 seconds
% 0.15/0.33  % Total memory used: 2.486 MB
% 0.15/0.33  % Net memory used: 2.474 MB
%------------------------------------------------------------------------------