↑ Up

Drodi---4.1.1.UNS-CRf.s

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

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

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

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

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

fof(f32,negated_conjecture,
    ~ less_or_equal(additive_identity,multiply(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f62,plain,
    ! [Z] :
      ( ~ less_or_equal(additive_identity,Z)
      | ! [Y] :
          ( ~ less_or_equal(additive_identity,Y)
          | less_or_equal(additive_identity,multiply(Y,Z)) ) ),
    inference(miniscoping,[status(thm)],[f20]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(additive_identity,X1)
      | ~ less_or_equal(additive_identity,X0)
      | less_or_equal(additive_identity,multiply(X0,X1)) ),
    inference(cnf_transformation,[status(thm)],[f62]) ).

fof(f77,plain,
    less_or_equal(additive_identity,a),
    inference(cnf_transformation,[status(thm)],[f30]) ).

fof(f78,plain,
    less_or_equal(additive_identity,b),
    inference(cnf_transformation,[status(thm)],[f31]) ).

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

fof(f86,plain,
    ( ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a) ),
    inference(resolution,[status(thm)],[f63,f79]) ).

fof(f89,definition,
    ( sQ0_spl
  <=> less_or_equal(additive_identity,a) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f91,plain,
    ( sQ0_spl
    | ~ less_or_equal(additive_identity,a) ),
    inference(component_clause,[status(thm)],[f89]) ).

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

fof(f94,plain,
    ( sQ1_spl
    | ~ less_or_equal(additive_identity,b) ),
    inference(component_clause,[status(thm)],[f92]) ).

fof(f95,plain,
    ( ~ sQ1_spl
    | ~ sQ0_spl ),
    inference(split_clause,[status(thm)],[f86,f89,f92]) ).

fof(f104,plain,
    ( sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f91,f77]) ).

fof(f105,plain,
    sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f104]) ).

fof(f106,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f94,f78]) ).

fof(f107,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f106]) ).

fof(f108,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f95,f105,f107]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD071-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n011.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 15:44:55 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.13/0.36  % Drodi V4.1.1
% 0.13/0.39  % Refutation found
% 0.13/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40  % Elapsed time: 0.042785 seconds
% 0.13/0.40  % CPU time: 0.111873 seconds
% 0.13/0.40  % Total memory used: 17.405 MB
% 0.13/0.40  % Net memory used: 17.194 MB
%------------------------------------------------------------------------------