%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP166-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 : 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:55 PM UTC 2026
% Result : Unsatisfiable 0.03s 8.38s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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; 3 con; 0-2 aty)
% Number of variables : 38 ( 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X] : multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] : multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] : greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
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/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
greatest_lower_bound(b,identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
greatest_lower_bound(a,multiply(a,b)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f20,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f21,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f22,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f31,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(f35,plain,
greatest_lower_bound(b,identity) = identity,
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f36,plain,
greatest_lower_bound(a,multiply(a,b)) != a,
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f41,plain,
greatest_lower_bound(identity,b) = identity,
inference(forward_demodulation,[status(thm)],[f22,f35]) ).
fof(f213,plain,
! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X2),multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f22,f31]) ).
fof(f224,plain,
! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = multiply(X0,greatest_lower_bound(X2,X1)),
inference(forward_demodulation,[status(thm)],[f31,f213]) ).
fof(f278,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f20,f21]) ).
fof(f281,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f19,f278]) ).
fof(f310,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f281,f281]) ).
fof(f311,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f20,f281]) ).
fof(f319,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f310,f311]) ).
fof(f331,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,identity)) = greatest_lower_bound(multiply(X0,X1),X0),
inference(paramodulation,[status(thm)],[f319,f31]) ).
fof(f337,plain,
multiply(a,greatest_lower_bound(b,identity)) != a,
inference(backward_demodulation,[status(thm)],[f338,f36]) ).
fof(f338,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,identity)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f22,f331]) ).
fof(f340,plain,
multiply(a,greatest_lower_bound(identity,b)) != a,
inference(forward_demodulation,[status(thm)],[f224,f337]) ).
fof(f341,plain,
multiply(a,identity) != a,
inference(forward_demodulation,[status(thm)],[f41,f340]) ).
fof(f342,plain,
a != a,
inference(forward_demodulation,[status(thm)],[f319,f341]) ).
fof(f343,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f342]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP166-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.02 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/8.36 % Computer : n012.cluster.edu
% 0.03/8.36 % Model : x86_64 x86_64
% 0.03/8.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/8.36 % Memory : 8046.5625MB
% 0.03/8.36 % OS : Linux 6.8.0-71-generic
% 0.03/8.36 % CPULimit : 300
% 0.03/8.36 % WCLimit : 300
% 0.03/8.36 % DateTime : Sun Sep 20 20:03:06 UTC 2026
% 0.03/8.36 % CPUTime :
% 0.03/8.37 % Drodi V4.1.1
% 0.03/8.38 % Refutation found
% 0.03/8.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.03/8.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.03/8.39 % Elapsed time: 0.022999 seconds
% 0.03/8.39 % CPU time: 0.083289 seconds
% 0.03/8.39 % Total memory used: 4.482 MB
% 0.03/8.39 % Net memory used: 4.405 MB
%------------------------------------------------------------------------------