↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n014.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.18s 0.49s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (  17 unt;   0 def)
%            Number of atoms       :   35 (  17 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   :   35 (  35   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X,Y] : less_equal(divide(X,Y),X),
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f9,axiom,
    ! [X] : divide(zero,X) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

fof(f14,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(f15,plain,
    ! [X0] : less_equal(zero,X0),
    inference(cnf_transformation,[status(thm)],[f5]) ).

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

fof(f19,plain,
    ! [X0] : divide(zero,X0) = zero,
    inference(cnf_transformation,[status(thm)],[f9]) ).

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

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

fof(f36,plain,
    ! [X0] :
      ( X0 = zero
      | ~ less_equal(X0,zero) ),
    inference(resolution,[status(thm)],[f16,f15]) ).

fof(f41,plain,
    ! [X0] :
      ( divide(X0,zero) != zero
      | X0 = zero ),
    inference(resolution,[status(thm)],[f36,f12]) ).

fof(f85,plain,
    ! [X0,X1] : less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
    inference(paramodulation,[status(thm)],[f19,f14]) ).

fof(f159,plain,
    ! [X0] : less_equal(divide(divide(X0,X0),zero),zero),
    inference(paramodulation,[status(thm)],[f24,f85]) ).

fof(f179,plain,
    ! [X0] : divide(divide(X0,X0),zero) = zero,
    inference(resolution,[status(thm)],[f159,f36]) ).

fof(f191,plain,
    ! [X0] : divide(X0,X0) = zero,
    inference(resolution,[status(thm)],[f179,f41]) ).

fof(f215,plain,
    zero != zero,
    inference(backward_demodulation,[status(thm)],[f191,f20]) ).

fof(f242,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f215]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : HEN003-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n014.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sun Sep 20 20:45:19 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.46  % Drodi V4.1.1
% 0.18/0.49  % Refutation found
% 0.18/0.49  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.49  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.51  % Elapsed time: 0.058687 seconds
% 0.18/0.51  % CPU time: 0.184423 seconds
% 0.18/0.51  % Total memory used: 48.754 MB
% 0.18/0.51  % Net memory used: 48.366 MB
%------------------------------------------------------------------------------