%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP171-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:57 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 53 ( 53 unt; 2 def)
% Number of atoms : 53 ( 52 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X] : multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] : multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] : greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] : least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y,Z] : greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
greatest_lower_bound(identity,multiply(a,b)) != identity,
file('/export/starexec/sandbox/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(f23,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f24,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f29,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,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f34,plain,
least_upper_bound(identity,a) = a,
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f35,plain,
least_upper_bound(identity,b) = b,
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f36,plain,
greatest_lower_bound(identity,multiply(a,b)) != identity,
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f37,definition,
sF1_fnc = multiply(a,b),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f38,definition,
sF0_fnc = greatest_lower_bound(identity,sF1_fnc),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f39,plain,
sF0_fnc != identity,
inference(definition_folding,[],[f36,f38,f37]) ).
fof(f40,plain,
least_upper_bound(a,identity) = a,
inference(forward_demodulation,[status(thm)],[f23,f34]) ).
fof(f41,plain,
least_upper_bound(b,identity) = b,
inference(forward_demodulation,[status(thm)],[f23,f35]) ).
fof(f58,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f133,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f24,f58]) ).
fof(f146,plain,
! [X0] : multiply(a,greatest_lower_bound(b,X0)) = greatest_lower_bound(sF1_fnc,multiply(a,X0)),
inference(paramodulation,[status(thm)],[f37,f31]) ).
fof(f203,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f20,f21]) ).
fof(f206,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f19,f203]) ).
fof(f207,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f206,f206]) ).
fof(f208,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f20,f206]) ).
fof(f218,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f207,f208]) ).
fof(f257,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f270,plain,
greatest_lower_bound(identity,b) = identity,
inference(paramodulation,[status(thm)],[f41,f257]) ).
fof(f271,plain,
greatest_lower_bound(identity,a) = identity,
inference(paramodulation,[status(thm)],[f40,f257]) ).
fof(f284,plain,
greatest_lower_bound(b,identity) = identity,
inference(forward_demodulation,[status(thm)],[f22,f270]) ).
fof(f285,plain,
greatest_lower_bound(a,identity) = identity,
inference(forward_demodulation,[status(thm)],[f22,f271]) ).
fof(f710,plain,
multiply(a,identity) = greatest_lower_bound(sF1_fnc,multiply(a,identity)),
inference(paramodulation,[status(thm)],[f284,f146]) ).
fof(f727,plain,
a = greatest_lower_bound(sF1_fnc,multiply(a,identity)),
inference(forward_demodulation,[status(thm)],[f218,f710]) ).
fof(f728,plain,
a = greatest_lower_bound(sF1_fnc,a),
inference(forward_demodulation,[status(thm)],[f218,f727]) ).
fof(f729,plain,
a = greatest_lower_bound(a,sF1_fnc),
inference(forward_demodulation,[status(thm)],[f22,f728]) ).
fof(f997,plain,
! [X0] : least_upper_bound(sF1_fnc,greatest_lower_bound(X0,a)) = sF1_fnc,
inference(paramodulation,[status(thm)],[f729,f133]) ).
fof(f1042,plain,
! [X0] : least_upper_bound(sF1_fnc,greatest_lower_bound(a,X0)) = sF1_fnc,
inference(paramodulation,[status(thm)],[f22,f997]) ).
fof(f1085,plain,
least_upper_bound(sF1_fnc,identity) = sF1_fnc,
inference(paramodulation,[status(thm)],[f285,f1042]) ).
fof(f1106,plain,
least_upper_bound(identity,sF1_fnc) = sF1_fnc,
inference(forward_demodulation,[status(thm)],[f23,f1085]) ).
fof(f1121,plain,
greatest_lower_bound(identity,sF1_fnc) = identity,
inference(paramodulation,[status(thm)],[f1106,f29]) ).
fof(f1127,plain,
sF0_fnc = identity,
inference(backward_demodulation,[status(thm)],[f1121,f38]) ).
fof(f1128,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1127,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP171-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37 % Computer : n017.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sun Sep 20 19:59:02 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 % Drodi V4.1.1
% 0.15/5.43 % Refutation found
% 0.15/5.43 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/5.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/5.44 % Elapsed time: 0.060796 seconds
% 0.15/5.44 % CPU time: 0.316145 seconds
% 0.15/5.44 % Total memory used: 10.993 MB
% 0.15/5.44 % Net memory used: 10.786 MB
%------------------------------------------------------------------------------