%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP147-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 : n007.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:52 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 46 unt; 2 def)
% Number of atoms : 46 ( 45 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 : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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/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(f16,hypothesis,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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(f25,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(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(f34,plain,
greatest_lower_bound(a,c) = a,
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f35,plain,
greatest_lower_bound(b,c) = b,
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f36,plain,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f37,definition,
sF1_fnc = least_upper_bound(a,b),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f38,definition,
sF0_fnc = greatest_lower_bound(sF1_fnc,c),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f39,plain,
sF0_fnc != sF1_fnc,
inference(definition_folding,[],[f36,f38,f37]) ).
fof(f40,plain,
sF0_fnc = greatest_lower_bound(c,sF1_fnc),
inference(paramodulation,[status(thm)],[f38,f22]) ).
fof(f52,plain,
least_upper_bound(sF1_fnc,sF0_fnc) = sF1_fnc,
inference(paramodulation,[status(thm)],[f38,f28]) ).
fof(f53,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f56,plain,
greatest_lower_bound(a,sF1_fnc) = a,
inference(paramodulation,[status(thm)],[f37,f29]) ).
fof(f58,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f69,plain,
least_upper_bound(sF0_fnc,sF1_fnc) = sF1_fnc,
inference(paramodulation,[status(thm)],[f23,f52]) ).
fof(f80,plain,
! [X0] : greatest_lower_bound(b,greatest_lower_bound(c,X0)) = greatest_lower_bound(b,X0),
inference(paramodulation,[status(thm)],[f35,f24]) ).
fof(f81,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(c,X0)) = greatest_lower_bound(a,X0),
inference(paramodulation,[status(thm)],[f34,f24]) ).
fof(f102,plain,
! [X0] : least_upper_bound(a,least_upper_bound(b,X0)) = least_upper_bound(sF1_fnc,X0),
inference(paramodulation,[status(thm)],[f37,f25]) ).
fof(f123,plain,
! [X0,X1] : least_upper_bound(least_upper_bound(X0,X1),X0) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f29,f53]) ).
fof(f131,plain,
! [X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X0)) = least_upper_bound(X0,X1),
inference(forward_demodulation,[status(thm)],[f25,f123]) ).
fof(f139,plain,
greatest_lower_bound(b,sF1_fnc) = b,
inference(paramodulation,[status(thm)],[f37,f58]) ).
fof(f1106,plain,
greatest_lower_bound(b,sF0_fnc) = greatest_lower_bound(b,sF1_fnc),
inference(paramodulation,[status(thm)],[f40,f80]) ).
fof(f1138,plain,
greatest_lower_bound(b,sF0_fnc) = b,
inference(forward_demodulation,[status(thm)],[f139,f1106]) ).
fof(f1184,plain,
least_upper_bound(sF0_fnc,b) = sF0_fnc,
inference(paramodulation,[status(thm)],[f1138,f53]) ).
fof(f1189,plain,
least_upper_bound(b,sF0_fnc) = sF0_fnc,
inference(paramodulation,[status(thm)],[f23,f1184]) ).
fof(f1200,plain,
least_upper_bound(a,sF0_fnc) = least_upper_bound(sF1_fnc,sF0_fnc),
inference(paramodulation,[status(thm)],[f1189,f102]) ).
fof(f1207,plain,
least_upper_bound(a,sF0_fnc) = sF1_fnc,
inference(forward_demodulation,[status(thm)],[f52,f1200]) ).
fof(f1210,plain,
least_upper_bound(sF0_fnc,sF1_fnc) = least_upper_bound(sF0_fnc,a),
inference(paramodulation,[status(thm)],[f1207,f131]) ).
fof(f1215,plain,
sF1_fnc = least_upper_bound(sF0_fnc,a),
inference(forward_demodulation,[status(thm)],[f69,f1210]) ).
fof(f1292,plain,
greatest_lower_bound(a,sF0_fnc) = greatest_lower_bound(a,sF1_fnc),
inference(paramodulation,[status(thm)],[f40,f81]) ).
fof(f1323,plain,
greatest_lower_bound(a,sF0_fnc) = a,
inference(forward_demodulation,[status(thm)],[f56,f1292]) ).
fof(f1644,plain,
least_upper_bound(sF0_fnc,a) = sF0_fnc,
inference(paramodulation,[status(thm)],[f1323,f53]) ).
fof(f1649,plain,
sF1_fnc = sF0_fnc,
inference(forward_demodulation,[status(thm)],[f1215,f1644]) ).
fof(f1650,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1649,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP147-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 % Computer : n007.cluster.edu
% 0.19/0.42 % Model : x86_64 x86_64
% 0.19/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.42 % Memory : 8046.5625MB
% 0.19/0.42 % OS : Linux 6.8.0-71-generic
% 0.19/0.42 % CPULimit : 300
% 0.19/0.42 % WCLimit : 300
% 0.19/0.42 % DateTime : Sun Sep 20 20:00:05 UTC 2026
% 0.19/0.43 % CPUTime :
% 0.19/0.44 % Drodi V4.1.1
% 0.19/0.57 % Refutation found
% 0.19/0.57 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.57 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.59 % Elapsed time: 0.145439 seconds
% 0.19/0.59 % CPU time: 0.975890 seconds
% 0.19/0.59 % Total memory used: 21.451 MB
% 0.19/0.59 % Net memory used: 21.140 MB
%------------------------------------------------------------------------------