↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n005.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:59:33 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (   8 unt;   2 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   46 (  23   ~;  21   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    e(exists),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ a(exists),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X1] :
      ( ~ e(X1)
      | r(X1,u0r3(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X3,X1,X2] :
      ( ~ r(X3,X2)
      | ~ r(X1,X2)
      | ~ e(X1)
      | a(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,plain,
    e(exists),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f9,plain,
    ~ a(exists),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ e(X0)
      | r(X0,u0r3(X0)) ),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f11,plain,
    ! [X3,X2] :
      ( ~ r(X3,X2)
      | ! [X1] :
          ( ~ r(X1,X2)
          | ~ e(X1)
          | a(X3) ) ),
    inference(miniscoping,[status(thm)],[f4]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( ~ r(X0,X2)
      | ~ r(X1,X2)
      | ~ e(X1)
      | a(X0) ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f19,plain,
    r(exists,u0r3(exists)),
    inference(resolution,[status(thm)],[f10,f8]) ).

fof(f20,plain,
    ! [X0] :
      ( ~ r(X0,u0r3(exists))
      | ~ e(exists)
      | a(X0) ),
    inference(resolution,[status(thm)],[f19,f12]) ).

fof(f21,definition,
    ! [X0] :
      ( sQ0_spl
    <=> ( ~ r(X0,u0r3(exists))
        | a(X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | ~ r(X0,u0r3(exists))
      | a(X0) ),
    inference(component_clause,[status(thm)],[f21]) ).

fof(f24,definition,
    ( sQ1_spl
  <=> e(exists) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f26,plain,
    ( sQ1_spl
    | ~ e(exists) ),
    inference(component_clause,[status(thm)],[f24]) ).

fof(f27,plain,
    ( ~ sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f20,f21,f24]) ).

fof(f28,plain,
    ( ~ sQ0_spl
    | a(exists) ),
    inference(resolution,[status(thm)],[f22,f19]) ).

fof(f29,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f28,f9]) ).

fof(f30,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f29]) ).

fof(f31,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f26,f8]) ).

fof(f32,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f31]) ).

fof(f33,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f27,f30,f32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS017-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 22:50:48 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.39  % Refutation found
% 0.09/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.41  % Elapsed time: 0.037746 seconds
% 0.09/0.41  % CPU time: 0.093666 seconds
% 0.09/0.41  % Total memory used: 11.385 MB
% 0.09/0.41  % Net memory used: 11.004 MB
%------------------------------------------------------------------------------