↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n016.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:51 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   19 (  19 unt;   2 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   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    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   11 (  11   !;   0   ?)

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

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

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

fof(f17,hypothesis,
    greatest_lower_bound(b,c) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f18,negated_conjecture,
    least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f24,plain,
    ! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
    inference(cnf_transformation,[status(thm)],[f6]) ).

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

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

fof(f35,plain,
    greatest_lower_bound(b,c) = c,
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f36,plain,
    least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
    inference(cnf_transformation,[status(thm)],[f18]) ).

fof(f37,definition,
    sF1_fnc = greatest_lower_bound(a,b),
    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).

fof(f38,definition,
    sF0_fnc = least_upper_bound(sF1_fnc,c),
    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).

fof(f39,plain,
    sF0_fnc != sF1_fnc,
    inference(definition_folding,[],[f36,f38,f37]) ).

fof(f90,plain,
    ! [X0] : greatest_lower_bound(a,greatest_lower_bound(b,X0)) = greatest_lower_bound(sF1_fnc,X0),
    inference(paramodulation,[status(thm)],[f37,f24]) ).

fof(f266,plain,
    greatest_lower_bound(a,c) = greatest_lower_bound(sF1_fnc,c),
    inference(paramodulation,[status(thm)],[f35,f90]) ).

fof(f275,plain,
    c = greatest_lower_bound(sF1_fnc,c),
    inference(forward_demodulation,[status(thm)],[f34,f266]) ).

fof(f293,plain,
    least_upper_bound(sF1_fnc,c) = sF1_fnc,
    inference(paramodulation,[status(thm)],[f275,f28]) ).

fof(f296,plain,
    sF0_fnc = sF1_fnc,
    inference(forward_demodulation,[status(thm)],[f38,f293]) ).

fof(f297,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f296,f39]) ).

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