%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP185-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n008.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:33:02 PM UTC 2026
% Result : Unsatisfiable 0.14s 6.01s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 19
% Syntax : Number of formulae : 75 ( 75 unt; 7 def)
% Number of atoms : 75 ( 74 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 : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 65 ( 65 !; 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(f5,axiom,
! [X,Y] : least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y,Z] : least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
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,hypothesis,
! [X] : inverse(inverse(X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f21,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f22,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f23,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f24,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f26,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f29,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f30,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f31,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(f33,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(f36,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f38,plain,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f39,definition,
sF2_fnc = multiply(a,b),
introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition]) ).
fof(f40,definition,
sF1_fnc = least_upper_bound(sF2_fnc,identity),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f41,definition,
sF4_fnc = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF4_fnc])],[function_definition]) ).
fof(f42,definition,
sF5_fnc = least_upper_bound(b,identity),
introduced(definition,[new_symbols(definition,[sF5_fnc])],[function_definition]) ).
fof(f43,definition,
sF3_fnc = multiply(sF4_fnc,sF5_fnc),
introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition]) ).
fof(f44,definition,
sF0_fnc = greatest_lower_bound(sF1_fnc,sF3_fnc),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f45,definition,
sF6_fnc = least_upper_bound(sF2_fnc,identity),
introduced(definition,[new_symbols(definition,[sF6_fnc])],[function_definition]) ).
fof(f46,plain,
sF0_fnc != sF6_fnc,
inference(definition_folding,[],[f38,f45,f44,f43,f42,f41,f40,f39]) ).
fof(f60,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f64,plain,
greatest_lower_bound(a,sF4_fnc) = a,
inference(paramodulation,[status(thm)],[f41,f30]) ).
fof(f67,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f24,f30]) ).
fof(f71,plain,
sF0_fnc != sF1_fnc,
inference(backward_demodulation,[status(thm)],[f72,f46]) ).
fof(f72,plain,
sF6_fnc = sF1_fnc,
inference(forward_demodulation,[status(thm)],[f40,f45]) ).
fof(f103,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f21,f22]) ).
fof(f104,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f20,f103]) ).
fof(f122,plain,
least_upper_bound(sF4_fnc,a) = sF4_fnc,
inference(paramodulation,[status(thm)],[f64,f60]) ).
fof(f136,plain,
greatest_lower_bound(identity,sF5_fnc) = identity,
inference(paramodulation,[status(thm)],[f42,f67]) ).
fof(f137,plain,
greatest_lower_bound(identity,sF4_fnc) = identity,
inference(paramodulation,[status(thm)],[f41,f67]) ).
fof(f175,plain,
! [X0] : least_upper_bound(sF2_fnc,least_upper_bound(identity,X0)) = least_upper_bound(sF1_fnc,X0),
inference(paramodulation,[status(thm)],[f40,f26]) ).
fof(f183,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f26,f67]) ).
fof(f198,plain,
! [X0] : multiply(sF4_fnc,least_upper_bound(sF5_fnc,X0)) = least_upper_bound(sF3_fnc,multiply(sF4_fnc,X0)),
inference(paramodulation,[status(thm)],[f43,f31]) ).
fof(f199,plain,
! [X0] : multiply(a,least_upper_bound(b,X0)) = least_upper_bound(sF2_fnc,multiply(a,X0)),
inference(paramodulation,[status(thm)],[f39,f31]) ).
fof(f274,plain,
least_upper_bound(a,sF4_fnc) = sF4_fnc,
inference(paramodulation,[status(thm)],[f24,f122]) ).
fof(f298,plain,
least_upper_bound(sF5_fnc,identity) = sF5_fnc,
inference(paramodulation,[status(thm)],[f136,f60]) ).
fof(f301,plain,
least_upper_bound(sF4_fnc,identity) = sF4_fnc,
inference(paramodulation,[status(thm)],[f137,f60]) ).
fof(f332,plain,
! [X0] : multiply(least_upper_bound(X0,sF4_fnc),sF5_fnc) = least_upper_bound(multiply(X0,sF5_fnc),sF3_fnc),
inference(paramodulation,[status(thm)],[f43,f33]) ).
fof(f528,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f21,f104]) ).
fof(f549,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f36,f528]) ).
fof(f1126,plain,
! [X0] : greatest_lower_bound(identity,least_upper_bound(X0,sF4_fnc)) = identity,
inference(paramodulation,[status(thm)],[f301,f183]) ).
fof(f1127,plain,
! [X0] : greatest_lower_bound(a,least_upper_bound(X0,sF4_fnc)) = a,
inference(paramodulation,[status(thm)],[f122,f183]) ).
fof(f4495,plain,
multiply(sF4_fnc,sF5_fnc) = least_upper_bound(sF3_fnc,multiply(sF4_fnc,identity)),
inference(paramodulation,[status(thm)],[f298,f198]) ).
fof(f4527,plain,
sF3_fnc = least_upper_bound(sF3_fnc,multiply(sF4_fnc,identity)),
inference(forward_demodulation,[status(thm)],[f43,f4495]) ).
fof(f4528,plain,
sF3_fnc = least_upper_bound(sF3_fnc,sF4_fnc),
inference(forward_demodulation,[status(thm)],[f549,f4527]) ).
fof(f4546,plain,
greatest_lower_bound(a,sF3_fnc) = a,
inference(paramodulation,[status(thm)],[f4528,f1127]) ).
fof(f4547,plain,
greatest_lower_bound(identity,sF3_fnc) = identity,
inference(paramodulation,[status(thm)],[f4528,f1126]) ).
fof(f4579,plain,
least_upper_bound(sF3_fnc,a) = sF3_fnc,
inference(paramodulation,[status(thm)],[f4546,f60]) ).
fof(f4600,plain,
least_upper_bound(sF3_fnc,identity) = sF3_fnc,
inference(paramodulation,[status(thm)],[f4547,f60]) ).
fof(f4628,plain,
least_upper_bound(a,sF3_fnc) = sF3_fnc,
inference(paramodulation,[status(thm)],[f24,f4579]) ).
fof(f4651,plain,
least_upper_bound(identity,sF3_fnc) = sF3_fnc,
inference(paramodulation,[status(thm)],[f24,f4600]) ).
fof(f4710,plain,
least_upper_bound(sF2_fnc,sF3_fnc) = least_upper_bound(sF1_fnc,sF3_fnc),
inference(paramodulation,[status(thm)],[f4651,f175]) ).
fof(f5339,plain,
multiply(a,sF5_fnc) = least_upper_bound(sF2_fnc,multiply(a,identity)),
inference(paramodulation,[status(thm)],[f42,f199]) ).
fof(f5368,plain,
multiply(a,sF5_fnc) = least_upper_bound(sF2_fnc,a),
inference(forward_demodulation,[status(thm)],[f549,f5339]) ).
fof(f12341,plain,
multiply(sF4_fnc,sF5_fnc) = least_upper_bound(multiply(a,sF5_fnc),sF3_fnc),
inference(paramodulation,[status(thm)],[f274,f332]) ).
fof(f12398,plain,
sF3_fnc = least_upper_bound(multiply(a,sF5_fnc),sF3_fnc),
inference(forward_demodulation,[status(thm)],[f43,f12341]) ).
fof(f12399,plain,
sF3_fnc = least_upper_bound(least_upper_bound(sF2_fnc,a),sF3_fnc),
inference(forward_demodulation,[status(thm)],[f5368,f12398]) ).
fof(f12400,plain,
sF3_fnc = least_upper_bound(sF2_fnc,least_upper_bound(a,sF3_fnc)),
inference(forward_demodulation,[status(thm)],[f26,f12399]) ).
fof(f12401,plain,
sF3_fnc = least_upper_bound(sF2_fnc,sF3_fnc),
inference(forward_demodulation,[status(thm)],[f4628,f12400]) ).
fof(f12402,plain,
sF3_fnc = least_upper_bound(sF1_fnc,sF3_fnc),
inference(forward_demodulation,[status(thm)],[f4710,f12401]) ).
fof(f12451,plain,
greatest_lower_bound(sF1_fnc,sF3_fnc) = sF1_fnc,
inference(paramodulation,[status(thm)],[f12402,f30]) ).
fof(f12456,plain,
sF0_fnc = sF1_fnc,
inference(forward_demodulation,[status(thm)],[f44,f12451]) ).
fof(f12457,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f12456,f71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP185-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.36 % Computer : n008.cluster.edu
% 0.10/5.36 % Model : x86_64 x86_64
% 0.10/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36 % Memory : 8046.5625MB
% 0.10/5.36 % OS : Linux 6.8.0-71-generic
% 0.10/5.36 % CPULimit : 300
% 0.10/5.36 % WCLimit : 300
% 0.10/5.36 % DateTime : Sun Sep 20 20:06:16 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 % Drodi V4.1.1
% 0.14/6.01 % Refutation found
% 0.14/6.01 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/6.01 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 23.63/9.88 % Elapsed time: 4.300871 seconds
% 23.63/9.88 % CPU time: 7.013131 seconds
% 23.63/9.88 % Total memory used: 3.307 GB
% 23.63/9.88 % Net memory used: 3.305 GB
%------------------------------------------------------------------------------