↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n015.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:32 PM UTC 2026

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

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

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

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

fof(f4,axiom,
    ! [X2,X1] :
      ( ~ r(X1,X2)
      | ~ c(X1)
      | d(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,axiom,
    ! [X1] :
      ( ~ e(u1r1(X1))
      | f(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,axiom,
    ! [X1] :
      ( r(X1,u1r1(X1))
      | f(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f14,plain,
    c(exists),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f15,plain,
    ~ f(exists),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f16,plain,
    ! [X3] :
      ( ~ d(X3)
      | ! [X1] :
          ( ~ r(X1,X3)
          | ~ c(X1)
          | e(X3) ) ),
    inference(miniscoping,[status(thm)],[f3]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ d(X0)
      | ~ r(X1,X0)
      | ~ c(X1)
      | e(X0) ),
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ r(X1,X0)
      | ~ c(X1)
      | d(X0) ),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f26,plain,
    ! [X0] :
      ( ~ e(u1r1(X0))
      | f(X0) ),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f27,plain,
    ! [X0] :
      ( r(X0,u1r1(X0))
      | f(X0) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ r(X1,X0)
      | ~ c(X1)
      | e(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[f17,f18]) ).

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

fof(f35,plain,
    ( ~ sQ1_spl
    | f(exists) ),
    inference(component_clause,[status(thm)],[f34]) ).

fof(f38,plain,
    ! [X0] :
      ( ~ r(exists,X0)
      | e(X0) ),
    inference(resolution,[status(thm)],[f28,f14]) ).

fof(f39,plain,
    ( f(exists)
    | e(u1r1(exists)) ),
    inference(resolution,[status(thm)],[f38,f27]) ).

fof(f40,definition,
    ( sQ2_spl
  <=> e(u1r1(exists)) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f41,plain,
    ( ~ sQ2_spl
    | e(u1r1(exists)) ),
    inference(component_clause,[status(thm)],[f40]) ).

fof(f43,plain,
    ( sQ1_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f39,f40,f34]) ).

fof(f44,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f35,f15]) ).

fof(f45,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f44]) ).

fof(f46,plain,
    ( ~ sQ2_spl
    | f(exists) ),
    inference(resolution,[status(thm)],[f41,f26]) ).

fof(f47,plain,
    ( ~ sQ2_spl
    | sQ1_spl ),
    inference(split_clause,[status(thm)],[f46,f34,f40]) ).

fof(f48,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f43,f45,f47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS012-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n015.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 22:53:35 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.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.14/0.40  % Elapsed time: 0.034466 seconds
% 0.14/0.40  % CPU time: 0.052586 seconds
% 0.14/0.40  % Total memory used: 3.128 MB
% 0.14/0.40  % Net memory used: 3.073 MB
%------------------------------------------------------------------------------