↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : FLD030-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:21:57 PM UTC 2026

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (  10 unt;   2 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(Y,X)
      | equalish(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

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

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

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

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

fof(f94,definition,
    ( sQ2_spl
  <=> defined(b) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f96,plain,
    ( sQ2_spl
    | ~ defined(b) ),
    inference(component_clause,[status(thm)],[f94]) ).

fof(f105,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f96,f76]) ).

fof(f106,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f105]) ).

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

fof(f110,definition,
    ( sQ5_spl
  <=> equalish(a,d) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f112,plain,
    ( sQ5_spl
    | ~ equalish(a,d) ),
    inference(component_clause,[status(thm)],[f110]) ).

fof(f113,plain,
    ( ~ sQ5_spl
    | ~ sQ2_spl ),
    inference(split_clause,[status(thm)],[f107,f94,f110]) ).

fof(f122,plain,
    ( sQ5_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f112,f78]) ).

fof(f123,plain,
    sQ5_spl,
    inference(contradiction_clause,[status(thm)],[f122]) ).

fof(f124,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f106,f113,f123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD030-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48  % Computer : n014.cluster.edu
% 0.18/0.48  % Model    : x86_64 x86_64
% 0.18/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48  % Memory   : 8046.5625MB
% 0.18/0.48  % OS       : Linux 6.8.0-71-generic
% 0.18/0.48  % CPULimit : 300
% 0.18/0.48  % WCLimit  : 300
% 0.18/0.48  % DateTime : Mon Sep 21 15:38:34 UTC 2026
% 0.18/0.49  % CPUTime  : 
% 0.18/0.50  % Drodi V4.1.1
% 0.21/0.52  % Refutation found
% 0.21/0.52  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.21/0.52  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.61  % Elapsed time: 0.112515 seconds
% 0.21/0.61  % CPU time: 0.081580 seconds
% 0.21/0.61  % Total memory used: 2.244 MB
% 0.21/0.61  % Net memory used: 2.236 MB
%------------------------------------------------------------------------------