↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n011.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:22:04 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.41s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   39 (  11 unt;   3 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   82 (  38   ~;  41   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   4 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   32 (  32   !;   0   ?)

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

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

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

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

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

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

fof(f32,negated_conjecture,
    equalish(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f33,negated_conjecture,
    ~ less_or_equal(a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f57,plain,
    ! [Z,Y] :
      ( ~ less_or_equal(Y,Z)
      | ! [X] :
          ( ~ less_or_equal(X,Y)
          | less_or_equal(X,Z) ) ),
    inference(miniscoping,[status(thm)],[f17]) ).

fof(f58,plain,
    ! [X0,X1,X2] :
      ( ~ less_or_equal(X2,X1)
      | ~ less_or_equal(X0,X2)
      | less_or_equal(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f57]) ).

fof(f59,plain,
    ! [Y] :
      ( ~ defined(Y)
      | ! [X] :
          ( ~ defined(X)
          | less_or_equal(Y,X)
          | less_or_equal(X,Y) ) ),
    inference(miniscoping,[status(thm)],[f18]) ).

fof(f60,plain,
    ! [X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | less_or_equal(X1,X0)
      | less_or_equal(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f59]) ).

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

fof(f73,plain,
    ! [Y,X] :
      ( ~ equalish(X,Y)
      | ! [Z] :
          ( ~ less_or_equal(X,Z)
          | less_or_equal(Y,Z) ) ),
    inference(miniscoping,[status(thm)],[f26]) ).

fof(f74,plain,
    ! [X0,X1,X2] :
      ( ~ equalish(X2,X0)
      | ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f73]) ).

fof(f78,plain,
    defined(c),
    inference(cnf_transformation,[status(thm)],[f30]) ).

fof(f79,plain,
    less_or_equal(a,b),
    inference(cnf_transformation,[status(thm)],[f31]) ).

fof(f80,plain,
    equalish(b,c),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f81,plain,
    ~ less_or_equal(a,c),
    inference(cnf_transformation,[status(thm)],[f33]) ).

fof(f82,plain,
    ! [X0] :
      ( ~ less_or_equal(b,X0)
      | less_or_equal(a,X0) ),
    inference(resolution,[status(thm)],[f58,f79]) ).

fof(f85,plain,
    ! [X0] :
      ( ~ defined(X0)
      | less_or_equal(c,X0)
      | less_or_equal(X0,c) ),
    inference(resolution,[status(thm)],[f60,f78]) ).

fof(f109,plain,
    ( less_or_equal(c,c)
    | ~ defined(c)
    | less_or_equal(c,c) ),
    inference(resolution,[status(thm)],[f85,f58]) ).

fof(f113,definition,
    ( sQ2_spl
  <=> less_or_equal(a,c) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f114,plain,
    ( ~ sQ2_spl
    | less_or_equal(a,c) ),
    inference(component_clause,[status(thm)],[f113]) ).

fof(f120,definition,
    ( sQ4_spl
  <=> less_or_equal(c,c) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f121,plain,
    ( ~ sQ4_spl
    | less_or_equal(c,c) ),
    inference(component_clause,[status(thm)],[f120]) ).

fof(f123,definition,
    ( sQ5_spl
  <=> defined(c) ),
    introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).

fof(f125,plain,
    ( sQ5_spl
    | ~ defined(c) ),
    inference(component_clause,[status(thm)],[f123]) ).

fof(f126,plain,
    ( ~ sQ5_spl
    | sQ4_spl ),
    inference(split_clause,[status(thm)],[f109,f120,f123]) ).

fof(f130,plain,
    ( ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f114,f81]) ).

fof(f131,plain,
    ~ sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f130]) ).

fof(f132,plain,
    ! [X0] :
      ( ~ sQ4_spl
      | ~ equalish(c,X0)
      | less_or_equal(X0,c) ),
    inference(resolution,[status(thm)],[f121,f74]) ).

fof(f141,plain,
    ! [X0] :
      ( ~ sQ4_spl
      | ~ equalish(X0,c)
      | less_or_equal(X0,c) ),
    inference(resolution,[status(thm)],[f132,f66]) ).

fof(f153,plain,
    ( ~ sQ4_spl
    | less_or_equal(b,c) ),
    inference(resolution,[status(thm)],[f141,f80]) ).

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

fof(f170,plain,
    sQ5_spl,
    inference(contradiction_clause,[status(thm)],[f169]) ).

fof(f172,plain,
    ( ~ sQ4_spl
    | less_or_equal(a,c) ),
    inference(resolution,[status(thm)],[f153,f82]) ).

fof(f177,plain,
    ( ~ sQ4_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f172,f113,f120]) ).

fof(f178,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f126,f131,f170,f177]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD055-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 15:42:41 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Drodi V4.1.1
% 0.10/0.41  % Refutation found
% 0.10/0.41  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.44  % Elapsed time: 0.052622 seconds
% 0.10/0.44  % CPU time: 0.173791 seconds
% 0.10/0.44  % Total memory used: 18.232 MB
% 0.10/0.44  % Net memory used: 17.970 MB
%------------------------------------------------------------------------------