↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.10s 0.39s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (  10 unt;   2 def)
%            Number of atoms       :   10 (   9 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   :    4 (   4   !;   0   ?)

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

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

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

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

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

fof(f34,definition,
    sF0_fnc = greatest_lower_bound(a,sF1_fnc),
    introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).

fof(f35,plain,
    sF0_fnc != a,
    inference(definition_folding,[],[f32,f34,f33]) ).

fof(f52,plain,
    greatest_lower_bound(a,sF1_fnc) = a,
    inference(paramodulation,[status(thm)],[f33,f27]) ).

fof(f58,plain,
    sF0_fnc = a,
    inference(forward_demodulation,[status(thm)],[f34,f52]) ).

fof(f59,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f58,f35]) ).

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