TSTP Solution File: GRP150-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : GRP150-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:19:32 EDT 2024

% Result   : Unsatisfiable 0.09s 0.29s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   8 unt;   0 def)
%            Number of atoms       :    8 (   7 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   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(f8,axiom,
    ! [X] : least_upper_bound(X,X) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f23,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(esa)],[f7]) ).

fof(f24,plain,
    ! [X0] : least_upper_bound(X0,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f8]) ).

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

fof(f39,plain,
    ! [X0,X1] : least_upper_bound(X0,least_upper_bound(X0,X1)) = least_upper_bound(X0,X1),
    inference(paramodulation,[status(thm)],[f24,f23]) ).

fof(f45,plain,
    $false,
    inference(resolution,[status(thm)],[f39,f32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem  : GRP150-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.02/0.08  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.27  % Computer : n032.cluster.edu
% 0.09/0.27  % Model    : x86_64 x86_64
% 0.09/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27  % Memory   : 8042.1875MB
% 0.09/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27  % CPULimit : 300
% 0.09/0.27  % WCLimit  : 300
% 0.09/0.27  % DateTime : Tue Apr 30 00:36:36 EDT 2024
% 0.09/0.27  % CPUTime  : 
% 0.09/0.28  % Drodi V3.6.0
% 0.09/0.29  % Refutation found
% 0.09/0.29  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.29  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.31  % Elapsed time: 0.016441 seconds
% 0.09/0.31  % CPU time: 0.019833 seconds
% 0.09/0.31  % Total memory used: 1.751 MB
% 0.09/0.31  % Net memory used: 1.669 MB
%------------------------------------------------------------------------------