↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n018.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:45:17 PM UTC 2026

% Result   : Unsatisfiable 0.08s 0.39s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  16 unt;   0 def)
%            Number of atoms       :   34 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   23 (  13   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   37 (  37   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X,Y] :
      ( divide(X,Y) = zero
      | ~ less_equal(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [X,Y] :
      ( less_equal(X,Y)
      | divide(X,Y) != zero ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X,Y] : less_equal(divide(X,Y),X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X,Z,Y] : less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X] : less_equal(zero,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f8,negated_conjecture,
    divide(a,a) != zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,plain,
    ! [X0,X1] :
      ( divide(X0,X1) = zero
      | ~ less_equal(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( less_equal(X0,X1)
      | divide(X0,X1) != zero ),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f11,plain,
    ! [X0,X1] : less_equal(divide(X0,X1),X0),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f12,plain,
    ! [X0,X1,X2] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f13,plain,
    ! [X0] : less_equal(zero,X0),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ less_equal(X1,X0)
      | ~ less_equal(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f16,plain,
    divide(a,a) != zero,
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f27,plain,
    ! [X0,X1] : divide(divide(X0,X1),X0) = zero,
    inference(resolution,[status(thm)],[f11,f9]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( divide(X0,X1) = X0
      | ~ less_equal(X0,divide(X0,X1)) ),
    inference(resolution,[status(thm)],[f14,f11]) ).

fof(f40,plain,
    ! [X0] :
      ( zero = X0
      | ~ less_equal(X0,zero) ),
    inference(resolution,[status(thm)],[f14,f13]) ).

fof(f60,plain,
    ! [X0,X1] : less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
    inference(paramodulation,[status(thm)],[f27,f12]) ).

fof(f122,plain,
    ! [X0,X1] : zero = divide(divide(X0,X0),divide(X1,X0)),
    inference(resolution,[status(thm)],[f60,f40]) ).

fof(f137,plain,
    ! [X0,X1] : less_equal(divide(X0,X0),divide(X1,X0)),
    inference(resolution,[status(thm)],[f122,f10]) ).

fof(f168,plain,
    ! [X0] : divide(divide(X0,X0),X0) = divide(X0,X0),
    inference(resolution,[status(thm)],[f137,f39]) ).

fof(f179,plain,
    ! [X0] : zero = divide(X0,X0),
    inference(forward_demodulation,[status(thm)],[f27,f168]) ).

fof(f182,plain,
    zero != zero,
    inference(backward_demodulation,[status(thm)],[f179,f16]) ).

fof(f204,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f182]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN003-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n018.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 20 20:47:29 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.08/0.39  % Refutation found
% 0.08/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.08/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.41  % Elapsed time: 0.045004 seconds
% 0.08/0.41  % CPU time: 0.132021 seconds
% 0.08/0.41  % Total memory used: 33.330 MB
% 0.08/0.41  % Net memory used: 32.974 MB
%------------------------------------------------------------------------------