%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP176-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 : n016.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:58 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% 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 ( 3 avg)
% Maximal term depth : 4 ( 2 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 : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X,Y,Z] : multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [Y,Z,X] : multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f28,plain,
! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f30,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f32,plain,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f42,plain,
multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))),
inference(forward_demodulation,[status(thm)],[f28,f32]) ).
fof(f43,plain,
multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,multiply(least_upper_bound(a,b),d)),
inference(forward_demodulation,[status(thm)],[f30,f42]) ).
fof(f44,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP176-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n016.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.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 20 20:08:37 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.45 % Drodi V4.1.1
% 0.17/0.49 % Refutation found
% 0.17/0.49 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.54 % Elapsed time: 0.084734 seconds
% 0.17/0.54 % CPU time: 0.040094 seconds
% 0.17/0.54 % Total memory used: 558.160 KB
% 0.17/0.54 % Net memory used: 555.088 KB
%------------------------------------------------------------------------------