↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.11s 0.40s
% Output   : CNFRefutation 0.11s
% 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(f7,axiom,
    ! [X,Y,Z] : least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

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

fof(f25,plain,
    ! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
    inference(cnf_transformation,[status(thm)],[f7]) ).

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

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

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

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

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

fof(f38,definition,
    sF0_fnc = greatest_lower_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(f111,plain,
    ! [X0] : least_upper_bound(a,least_upper_bound(b,X0)) = least_upper_bound(sF1_fnc,X0),
    inference(paramodulation,[status(thm)],[f37,f25]) ).

fof(f1199,plain,
    least_upper_bound(a,c) = least_upper_bound(sF1_fnc,c),
    inference(paramodulation,[status(thm)],[f35,f111]) ).

fof(f1220,plain,
    c = least_upper_bound(sF1_fnc,c),
    inference(forward_demodulation,[status(thm)],[f34,f1199]) ).

fof(f1243,plain,
    greatest_lower_bound(sF1_fnc,c) = sF1_fnc,
    inference(paramodulation,[status(thm)],[f1220,f29]) ).

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

fof(f1248,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f1247,f39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP148-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.37  % Computer : n026.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 20 20:05:22 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % Drodi V4.1.1
% 0.11/0.40  % Refutation found
% 0.11/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.42  % Elapsed time: 0.037947 seconds
% 0.11/0.42  % CPU time: 0.145942 seconds
% 0.11/0.42  % Total memory used: 5.569 MB
% 0.11/0.42  % Net memory used: 5.485 MB
%------------------------------------------------------------------------------