%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP176-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:59 PM UTC 2026
% Result : Unsatisfiable 0.08s 10.38s
% Output : CNFRefutation 0.08s
% 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(f17,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(f29,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(f31,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(f34,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)],[f17]) ).
fof(f44,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)],[f29,f34]) ).
fof(f45,plain,
multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,multiply(least_upper_bound(a,b),d)),
inference(forward_demodulation,[status(thm)],[f31,f44]) ).
fof(f46,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP176-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/10.37 % Computer : n001.cluster.edu
% 0.08/10.37 % Model : x86_64 x86_64
% 0.08/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37 % Memory : 8046.5625MB
% 0.08/10.37 % OS : Linux 6.8.0-71-generic
% 0.08/10.37 % CPULimit : 300
% 0.08/10.37 % WCLimit : 300
% 0.08/10.37 % DateTime : Sun Sep 20 20:09:39 UTC 2026
% 0.08/10.37 % CPUTime :
% 0.08/10.38 % Drodi V4.1.1
% 0.08/10.38 % Refutation found
% 0.08/10.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.08/10.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/10.40 % Elapsed time: 0.023685 seconds
% 0.13/10.40 % CPU time: 0.032610 seconds
% 0.13/10.40 % Total memory used: 682.256 KB
% 0.13/10.40 % Net memory used: 659.088 KB
%------------------------------------------------------------------------------