%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP156-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 : n026.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.02s 0.37s
% Output : CNFRefutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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/sandbox/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(thm)],[f11]) ).
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,
least_upper_bound(a,b) = b,
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,
greatest_lower_bound(a,b) = a,
inference(paramodulation,[status(thm)],[f33,f28]) ).
fof(f41,plain,
multiply(a,c) != multiply(a,c),
inference(backward_demodulation,[status(thm)],[f40,f39]) ).
fof(f42,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP156-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n026.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 20:05:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.02/0.36 % Drodi V4.1.1
% 0.02/0.37 % Refutation found
% 0.02/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.02/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.02/0.38 % Elapsed time: 0.022635 seconds
% 0.02/0.38 % CPU time: 0.031042 seconds
% 0.02/0.38 % Total memory used: 692.672 KB
% 0.02/0.38 % Net memory used: 670.000 KB
%------------------------------------------------------------------------------