↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : GRP143-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 : n020.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.17s 0.45s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   17 (  17 unt;   2 def)
%            Number of atoms       :   17 (  16 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (  14   !;   0   ?)

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

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(f9,axiom,
    ! [X] : greatest_lower_bound(X,X) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f22,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(f25,plain,
    ! [X0] : greatest_lower_bound(X0,X0) = X0,
    inference(cnf_transformation,[status(thm)],[f9]) ).

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

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

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

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

fof(f36,plain,
    sF0_fnc = greatest_lower_bound(a,sF1_fnc),
    inference(paramodulation,[status(thm)],[f34,f20]) ).

fof(f58,plain,
    ! [X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X0,X1)) = greatest_lower_bound(X0,X1),
    inference(paramodulation,[status(thm)],[f25,f22]) ).

fof(f71,plain,
    greatest_lower_bound(a,sF1_fnc) = greatest_lower_bound(a,b),
    inference(paramodulation,[status(thm)],[f33,f58]) ).

fof(f85,plain,
    sF0_fnc = greatest_lower_bound(a,b),
    inference(forward_demodulation,[status(thm)],[f36,f71]) ).

fof(f86,plain,
    sF0_fnc = sF1_fnc,
    inference(forward_demodulation,[status(thm)],[f33,f85]) ).

fof(f87,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f86,f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP143-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n020.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sun Sep 20 20:03:02 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.44  % Drodi V4.1.1
% 0.17/0.45  % Refutation found
% 0.17/0.45  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.45  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.50  % Elapsed time: 0.052888 seconds
% 0.17/0.50  % CPU time: 0.036996 seconds
% 0.17/0.50  % Total memory used: 463.392 KB
% 0.17/0.50  % Net memory used: 461.024 KB
%------------------------------------------------------------------------------