%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP158-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 : n012.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:54 PM UTC 2026
% Result : Unsatisfiable 0.03s 0.30s
% Output : CNFRefutation 0.03s
% 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(f13,axiom,
! [X,Y,Z] : multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f30,plain,
! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f33,plain,
greatest_lower_bound(a,b) = a,
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f34,plain,
greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f39,plain,
multiply(c,greatest_lower_bound(a,b)) != multiply(c,a),
inference(forward_demodulation,[status(thm)],[f30,f34]) ).
fof(f40,plain,
multiply(c,a) != multiply(c,a),
inference(forward_demodulation,[status(thm)],[f33,f39]) ).
fof(f41,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP158-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.02 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Sun Sep 20 20:02:36 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 % Drodi V4.1.1
% 0.03/0.30 % Refutation found
% 0.03/0.30 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.03/0.30 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.03/0.32 % Elapsed time: 0.016405 seconds
% 0.03/0.32 % CPU time: 0.015331 seconds
% 0.03/0.32 % Total memory used: 452.512 KB
% 0.03/0.32 % Net memory used: 451.328 KB
%------------------------------------------------------------------------------