↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : FLD058-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 : 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:22:04 PM UTC 2026

% Result   : Unsatisfiable 0.13s 5.45s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   38 (  13 unt;   3 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   65 (  32   ~;  30   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

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

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

fof(f23,axiom,
    ! [X,Z,Y] :
      ( ~ equalish(Y,Z)
      | ~ equalish(X,Y)
      | equalish(X,Z) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).

fof(f30,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f33,negated_conjecture,
    equalish(b,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

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,
    less_or_equal(additive_identity,a),
    inference(cnf_transformation,[status(thm)],[f30]) ).

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

fof(f80,plain,
    ~ equalish(a,additive_identity),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f81,plain,
    equalish(b,additive_identity),
    inference(cnf_transformation,[status(thm)],[f33]) ).

fof(f82,plain,
    ( ~ less_or_equal(b,a)
    | equalish(b,a) ),
    inference(resolution,[status(thm)],[f56,f79]) ).

fof(f84,definition,
    ( sQ0_spl
  <=> equalish(b,a) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f85,plain,
    ( ~ sQ0_spl
    | equalish(b,a) ),
    inference(component_clause,[status(thm)],[f84]) ).

fof(f87,definition,
    ( sQ1_spl
  <=> less_or_equal(b,a) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f89,plain,
    ( sQ1_spl
    | ~ less_or_equal(b,a) ),
    inference(component_clause,[status(thm)],[f87]) ).

fof(f90,plain,
    ( ~ sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f82,f84,f87]) ).

fof(f91,definition,
    ( sQ2_spl
  <=> equalish(a,additive_identity) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f92,plain,
    ( ~ sQ2_spl
    | equalish(a,additive_identity) ),
    inference(component_clause,[status(thm)],[f91]) ).

fof(f98,plain,
    ( ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f92,f80]) ).

fof(f99,plain,
    ~ sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f98]) ).

fof(f117,plain,
    ( ~ sQ0_spl
    | equalish(a,b) ),
    inference(resolution,[status(thm)],[f66,f85]) ).

fof(f118,plain,
    equalish(additive_identity,b),
    inference(resolution,[status(thm)],[f66,f81]) ).

fof(f130,plain,
    ! [X0] :
      ( ~ equalish(X0,b)
      | equalish(X0,additive_identity) ),
    inference(resolution,[status(thm)],[f68,f81]) ).

fof(f158,plain,
    ! [X0] :
      ( ~ less_or_equal(additive_identity,X0)
      | less_or_equal(b,X0) ),
    inference(resolution,[status(thm)],[f118,f74]) ).

fof(f184,plain,
    ( ~ sQ0_spl
    | equalish(a,additive_identity) ),
    inference(resolution,[status(thm)],[f130,f117]) ).

fof(f188,plain,
    ( ~ sQ0_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f184,f91,f84]) ).

fof(f236,plain,
    less_or_equal(b,a),
    inference(resolution,[status(thm)],[f158,f78]) ).

fof(f238,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f236,f89]) ).

fof(f239,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f238]) ).

fof(f240,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f90,f99,f188,f239]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD058-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/5.41  % Computer : n005.cluster.edu
% 0.13/5.41  % Model    : x86_64 x86_64
% 0.13/5.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.41  % Memory   : 8046.5625MB
% 0.13/5.41  % OS       : Linux 6.8.0-71-generic
% 0.13/5.41  % CPULimit : 300
% 0.13/5.41  % WCLimit  : 300
% 0.13/5.41  % DateTime : Mon Sep 21 15:43:23 UTC 2026
% 0.13/5.41  % CPUTime  : 
% 0.13/5.42  % Drodi V4.1.1
% 0.13/5.45  % Refutation found
% 0.13/5.45  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/5.45  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/5.49  % Elapsed time: 0.062484 seconds
% 0.13/5.49  % CPU time: 0.237235 seconds
% 0.13/5.49  % Total memory used: 18.535 MB
% 0.13/5.49  % Net memory used: 18.297 MB
%------------------------------------------------------------------------------