%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP150-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 14 unt; 2 def)
% Number of atoms : 14 ( 13 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f8,axiom,
! [X] : least_upper_bound(X,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,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(f24,plain,
! [X0] : least_upper_bound(X0,X0) = X0,
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f32,plain,
least_upper_bound(a,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f33,definition,
sF1_fnc = least_upper_bound(a,b),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f34,definition,
sF0_fnc = least_upper_bound(a,sF1_fnc),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f35,plain,
sF0_fnc != sF1_fnc,
inference(definition_folding,[],[f32,f34,f33]) ).
fof(f53,plain,
! [X0,X1] : least_upper_bound(X0,least_upper_bound(X0,X1)) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f24,f23]) ).
fof(f65,plain,
least_upper_bound(a,sF1_fnc) = least_upper_bound(a,b),
inference(paramodulation,[status(thm)],[f33,f53]) ).
fof(f78,plain,
sF0_fnc = least_upper_bound(a,b),
inference(forward_demodulation,[status(thm)],[f34,f65]) ).
fof(f79,plain,
sF0_fnc = sF1_fnc,
inference(forward_demodulation,[status(thm)],[f33,f78]) ).
fof(f80,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f79,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP150-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:04:44 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.38 % Refutation found
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.40 % Elapsed time: 0.027464 seconds
% 0.10/0.40 % CPU time: 0.023642 seconds
% 0.10/0.40 % Total memory used: 439.664 KB
% 0.10/0.40 % Net memory used: 416.512 KB
%------------------------------------------------------------------------------