↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n010.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:33:00 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.37s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   13 (  13 unt;   2 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   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;   4 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   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(f10,axiom,
    ! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

fof(f38,plain,
    least_upper_bound(identity,greatest_lower_bound(a,identity)) != identity,
    inference(cnf_transformation,[status(thm)],[f19]) ).

fof(f39,definition,
    sF1_fnc = greatest_lower_bound(a,identity),
    introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).

fof(f40,definition,
    sF0_fnc = least_upper_bound(identity,sF1_fnc),
    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).

fof(f41,plain,
    sF0_fnc != identity,
    inference(definition_folding,[],[f38,f40,f39]) ).

fof(f52,plain,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
    inference(paramodulation,[status(thm)],[f23,f29]) ).

fof(f63,plain,
    least_upper_bound(identity,sF1_fnc) = identity,
    inference(paramodulation,[status(thm)],[f39,f52]) ).

fof(f70,plain,
    sF0_fnc = identity,
    inference(forward_demodulation,[status(thm)],[f40,f63]) ).

fof(f71,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f70,f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP182-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n010.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sun Sep 20 20:04:40 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % Drodi V4.1.1
% 0.14/0.37  % Refutation found
% 0.14/0.37  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.38  % Elapsed time: 0.024315 seconds
% 0.14/0.38  % CPU time: 0.026037 seconds
% 0.14/0.38  % Total memory used: 439.168 KB
% 0.14/0.38  % Net memory used: 437.040 KB
%------------------------------------------------------------------------------