↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n001.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:32:54 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X,Y] : greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f10,axiom,
    ! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,axiom,
    ! [X,Y,Z] : multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,hypothesis,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f17,negated_conjecture,
    least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f21,plain,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f22,plain,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f27,plain,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f29,plain,
    ! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f33,plain,
    greatest_lower_bound(a,b) = a,
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f34,plain,
    least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f47,plain,
    least_upper_bound(multiply(c,b),multiply(c,a)) != multiply(c,b),
    inference(backward_demodulation,[status(thm)],[f22,f34]) ).

fof(f77,plain,
    greatest_lower_bound(b,a) = a,
    inference(backward_demodulation,[status(thm)],[f21,f33]) ).

fof(f122,plain,
    multiply(c,least_upper_bound(b,a)) != multiply(c,b),
    inference(forward_demodulation,[status(thm)],[f29,f47]) ).

fof(f124,plain,
    b = least_upper_bound(b,a),
    inference(paramodulation,[status(thm)],[f77,f27]) ).

fof(f125,plain,
    multiply(c,b) != multiply(c,b),
    inference(backward_demodulation,[status(thm)],[f124,f122]) ).

fof(f129,plain,
    $false,
    inference(equality_resolution,[status(thm)],[f125]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP159-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n001.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 20 20:08:13 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % Drodi V4.1.1
% 0.11/0.38  % Refutation found
% 0.11/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.41  % Elapsed time: 0.035782 seconds
% 0.11/0.41  % CPU time: 0.057634 seconds
% 0.11/0.41  % Total memory used: 2.173 MB
% 0.11/0.41  % Net memory used: 2.143 MB
%------------------------------------------------------------------------------