↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.10s 0.36s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    9 (   9 unt;   0 def)
%            Number of atoms       :    9 (   8 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   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;   3 con; 0-2 aty)
%            Number of variables   :    6 (   6   !;   0   ?)

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

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

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

fof(f32,plain,
    ! [X0,X1,X2] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
    inference(cnf_transformation,[status(thm)],[f15]) ).

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

fof(f34,plain,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f39,plain,
    multiply(greatest_lower_bound(a,b),c) != multiply(a,c),
    inference(forward_demodulation,[status(thm)],[f32,f34]) ).

fof(f40,plain,
    multiply(a,c) != multiply(a,c),
    inference(forward_demodulation,[status(thm)],[f33,f39]) ).

fof(f41,plain,
    $false,
    inference(trivial_equality_resolution,[status(thm)],[f40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP155-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.34  % Computer : n010.cluster.edu
% 0.10/0.34  % Model    : x86_64 x86_64
% 0.10/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34  % Memory   : 8046.5625MB
% 0.10/0.34  % OS       : Linux 6.8.0-71-generic
% 0.10/0.34  % CPULimit : 300
% 0.10/0.34  % WCLimit  : 300
% 0.10/0.34  % DateTime : Sun Sep 20 20:03:09 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.36  % Drodi V4.1.1
% 0.10/0.36  % Refutation found
% 0.10/0.36  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.026534 seconds
% 0.13/0.38  % CPU time: 0.027619 seconds
% 0.13/0.38  % Total memory used: 659.264 KB
% 0.13/0.38  % Net memory used: 635.488 KB
%------------------------------------------------------------------------------