%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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:59 PM UTC 2026
% Result : Unsatisfiable 8.94s 1.90s
% Output : CNFRefutation 8.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 22
% Syntax : Number of formulae : 122 ( 122 unt; 4 def)
% Number of atoms : 122 ( 121 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 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 116 ( 116 !; 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(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/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(f9,axiom,
! [X] : greatest_lower_bound(X,X) = X,
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(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(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(f15,axiom,
! [Y,Z,X] : multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
! [X] : inverse(inverse(X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,hypothesis,
! [X,Y] : inverse(multiply(X,Y)) = multiply(inverse(Y),inverse(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,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(f25,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(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(f28,plain,
! [X0] : greatest_lower_bound(X0,X0) = X0,
inference(cnf_transformation,[status(thm)],[f9]) ).
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(f32,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(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(f34,plain,
! [X0,X1,X2] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f35,plain,
inverse(identity) = identity,
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f36,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f37,plain,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f38,plain,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f39,definition,
sF1_fnc = inverse(a),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f40,definition,
sF0_fnc = least_upper_bound(sF1_fnc,identity),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f41,definition,
sF3_fnc = greatest_lower_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition]) ).
fof(f42,definition,
sF2_fnc = inverse(sF3_fnc),
introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition]) ).
fof(f43,plain,
sF0_fnc != sF2_fnc,
inference(definition_folding,[],[f38,f42,f41,f40,f39]) ).
fof(f46,plain,
inverse(sF2_fnc) = sF3_fnc,
inference(paramodulation,[status(thm)],[f42,f36]) ).
fof(f47,plain,
inverse(sF1_fnc) = a,
inference(paramodulation,[status(thm)],[f39,f36]) ).
fof(f50,plain,
multiply(a,sF1_fnc) = identity,
inference(paramodulation,[status(thm)],[f47,f21]) ).
fof(f51,plain,
multiply(sF3_fnc,sF2_fnc) = identity,
inference(paramodulation,[status(thm)],[f46,f21]) ).
fof(f52,plain,
! [X0] : multiply(X0,inverse(X0)) = identity,
inference(paramodulation,[status(thm)],[f36,f21]) ).
fof(f54,plain,
multiply(sF2_fnc,sF3_fnc) = identity,
inference(paramodulation,[status(thm)],[f42,f21]) ).
fof(f60,plain,
sF0_fnc = least_upper_bound(identity,sF1_fnc),
inference(paramodulation,[status(thm)],[f40,f24]) ).
fof(f68,plain,
least_upper_bound(a,sF3_fnc) = a,
inference(paramodulation,[status(thm)],[f41,f29]) ).
fof(f69,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f74,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f24,f30]) ).
fof(f81,plain,
! [X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X1))) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f28,f25]) ).
fof(f83,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(identity,X0)) = greatest_lower_bound(sF3_fnc,X0),
inference(paramodulation,[status(thm)],[f41,f25]) ).
fof(f102,plain,
! [X0] : least_upper_bound(sF1_fnc,least_upper_bound(identity,X0)) = least_upper_bound(sF0_fnc,X0),
inference(paramodulation,[status(thm)],[f40,f26]) ).
fof(f125,plain,
greatest_lower_bound(identity,sF0_fnc) = identity,
inference(paramodulation,[status(thm)],[f60,f30]) ).
fof(f131,plain,
least_upper_bound(identity,sF3_fnc) = identity,
inference(paramodulation,[status(thm)],[f41,f69]) ).
fof(f132,plain,
! [X0,X1] : least_upper_bound(least_upper_bound(X0,X1),X0) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f30,f69]) ).
fof(f140,plain,
! [X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X0)) = least_upper_bound(X0,X1),
inference(forward_demodulation,[status(thm)],[f26,f132]) ).
fof(f150,plain,
greatest_lower_bound(sF3_fnc,a) = sF3_fnc,
inference(paramodulation,[status(thm)],[f68,f74]) ).
fof(f168,plain,
! [X0] : greatest_lower_bound(identity,greatest_lower_bound(sF0_fnc,X0)) = greatest_lower_bound(identity,X0),
inference(paramodulation,[status(thm)],[f125,f25]) ).
fof(f170,plain,
greatest_lower_bound(sF3_fnc,identity) = sF3_fnc,
inference(paramodulation,[status(thm)],[f131,f74]) ).
fof(f179,plain,
! [X0] : multiply(identity,X0) = multiply(sF2_fnc,multiply(sF3_fnc,X0)),
inference(paramodulation,[status(thm)],[f54,f22]) ).
fof(f181,plain,
! [X0] : multiply(identity,X0) = multiply(a,multiply(sF1_fnc,X0)),
inference(paramodulation,[status(thm)],[f50,f22]) ).
fof(f182,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f21,f22]) ).
fof(f184,plain,
! [X0,X1] : multiply(identity,X0) = multiply(X1,multiply(inverse(X1),X0)),
inference(paramodulation,[status(thm)],[f52,f22]) ).
fof(f189,plain,
! [X0] : X0 = multiply(sF2_fnc,multiply(sF3_fnc,X0)),
inference(forward_demodulation,[status(thm)],[f20,f179]) ).
fof(f191,plain,
! [X0] : X0 = multiply(a,multiply(sF1_fnc,X0)),
inference(forward_demodulation,[status(thm)],[f20,f181]) ).
fof(f192,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f20,f182]) ).
fof(f193,plain,
! [X0,X1] : X0 = multiply(X1,multiply(inverse(X1),X0)),
inference(forward_demodulation,[status(thm)],[f20,f184]) ).
fof(f202,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(paramodulation,[status(thm)],[f21,f31]) ).
fof(f210,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(paramodulation,[status(thm)],[f21,f31]) ).
fof(f239,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(paramodulation,[status(thm)],[f21,f32]) ).
fof(f302,plain,
greatest_lower_bound(identity,sF3_fnc) = sF3_fnc,
inference(paramodulation,[status(thm)],[f23,f170]) ).
fof(f332,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X0),X1) = least_upper_bound(X1,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f20,f33]) ).
fof(f365,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X0),X1) = greatest_lower_bound(X1,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f20,f34]) ).
fof(f473,plain,
! [X0] : inverse(multiply(sF3_fnc,X0)) = multiply(inverse(X0),sF2_fnc),
inference(paramodulation,[status(thm)],[f42,f37]) ).
fof(f763,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f21,f192]) ).
fof(f783,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f36,f763]) ).
fof(f817,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(paramodulation,[status(thm)],[f37,f193]) ).
fof(f978,plain,
greatest_lower_bound(identity,greatest_lower_bound(sF3_fnc,a)) = greatest_lower_bound(identity,a),
inference(paramodulation,[status(thm)],[f83,f81]) ).
fof(f1025,plain,
greatest_lower_bound(identity,sF3_fnc) = greatest_lower_bound(identity,a),
inference(forward_demodulation,[status(thm)],[f150,f978]) ).
fof(f1026,plain,
sF3_fnc = greatest_lower_bound(identity,a),
inference(forward_demodulation,[status(thm)],[f302,f1025]) ).
fof(f4783,plain,
multiply(inverse(sF1_fnc),sF0_fnc) = least_upper_bound(identity,multiply(inverse(sF1_fnc),identity)),
inference(paramodulation,[status(thm)],[f40,f202]) ).
fof(f4874,plain,
multiply(a,sF0_fnc) = least_upper_bound(identity,multiply(inverse(sF1_fnc),identity)),
inference(forward_demodulation,[status(thm)],[f47,f4783]) ).
fof(f4875,plain,
multiply(a,sF0_fnc) = least_upper_bound(identity,inverse(sF1_fnc)),
inference(forward_demodulation,[status(thm)],[f783,f4874]) ).
fof(f4876,plain,
multiply(a,sF0_fnc) = least_upper_bound(identity,a),
inference(forward_demodulation,[status(thm)],[f47,f4875]) ).
fof(f4928,plain,
multiply(inverse(sF3_fnc),identity) = least_upper_bound(multiply(inverse(sF3_fnc),identity),identity),
inference(paramodulation,[status(thm)],[f131,f210]) ).
fof(f4996,plain,
inverse(sF3_fnc) = least_upper_bound(multiply(inverse(sF3_fnc),identity),identity),
inference(forward_demodulation,[status(thm)],[f783,f4928]) ).
fof(f4997,plain,
sF2_fnc = least_upper_bound(multiply(inverse(sF3_fnc),identity),identity),
inference(forward_demodulation,[status(thm)],[f42,f4996]) ).
fof(f4998,plain,
sF2_fnc = least_upper_bound(inverse(sF3_fnc),identity),
inference(forward_demodulation,[status(thm)],[f783,f4997]) ).
fof(f4999,plain,
sF2_fnc = least_upper_bound(sF2_fnc,identity),
inference(forward_demodulation,[status(thm)],[f42,f4998]) ).
fof(f5024,plain,
sF2_fnc = least_upper_bound(identity,sF2_fnc),
inference(paramodulation,[status(thm)],[f24,f4999]) ).
fof(f5068,plain,
least_upper_bound(sF1_fnc,sF2_fnc) = least_upper_bound(sF0_fnc,sF2_fnc),
inference(paramodulation,[status(thm)],[f5024,f102]) ).
fof(f6207,plain,
least_upper_bound(sF2_fnc,least_upper_bound(sF0_fnc,sF2_fnc)) = least_upper_bound(sF2_fnc,sF1_fnc),
inference(paramodulation,[status(thm)],[f5068,f140]) ).
fof(f6219,plain,
least_upper_bound(sF2_fnc,sF0_fnc) = least_upper_bound(sF2_fnc,sF1_fnc),
inference(forward_demodulation,[status(thm)],[f140,f6207]) ).
fof(f6629,plain,
multiply(inverse(a),sF3_fnc) = greatest_lower_bound(identity,multiply(inverse(a),identity)),
inference(paramodulation,[status(thm)],[f41,f239]) ).
fof(f6769,plain,
multiply(sF1_fnc,sF3_fnc) = greatest_lower_bound(identity,multiply(inverse(a),identity)),
inference(forward_demodulation,[status(thm)],[f39,f6629]) ).
fof(f6770,plain,
multiply(sF1_fnc,sF3_fnc) = greatest_lower_bound(identity,inverse(a)),
inference(forward_demodulation,[status(thm)],[f783,f6769]) ).
fof(f6771,plain,
multiply(sF1_fnc,sF3_fnc) = greatest_lower_bound(identity,sF1_fnc),
inference(forward_demodulation,[status(thm)],[f39,f6770]) ).
fof(f7516,plain,
sF3_fnc = multiply(a,greatest_lower_bound(identity,sF1_fnc)),
inference(paramodulation,[status(thm)],[f6771,f191]) ).
fof(f8129,plain,
inverse(a) = multiply(greatest_lower_bound(identity,sF1_fnc),inverse(sF3_fnc)),
inference(paramodulation,[status(thm)],[f7516,f817]) ).
fof(f8142,plain,
sF1_fnc = multiply(greatest_lower_bound(identity,sF1_fnc),inverse(sF3_fnc)),
inference(forward_demodulation,[status(thm)],[f39,f8129]) ).
fof(f8143,plain,
sF1_fnc = multiply(greatest_lower_bound(identity,sF1_fnc),sF2_fnc),
inference(forward_demodulation,[status(thm)],[f42,f8142]) ).
fof(f8723,plain,
! [X0,X1] : multiply(identity,X0) = least_upper_bound(X0,multiply(greatest_lower_bound(identity,X1),X0)),
inference(paramodulation,[status(thm)],[f29,f332]) ).
fof(f8818,plain,
! [X0,X1] : X0 = least_upper_bound(X0,multiply(greatest_lower_bound(identity,X1),X0)),
inference(forward_demodulation,[status(thm)],[f20,f8723]) ).
fof(f9405,plain,
sF2_fnc = least_upper_bound(sF2_fnc,sF1_fnc),
inference(paramodulation,[status(thm)],[f8143,f8818]) ).
fof(f9486,plain,
sF2_fnc = least_upper_bound(sF2_fnc,sF0_fnc),
inference(forward_demodulation,[status(thm)],[f6219,f9405]) ).
fof(f9526,plain,
sF2_fnc = least_upper_bound(sF0_fnc,sF2_fnc),
inference(paramodulation,[status(thm)],[f24,f9486]) ).
fof(f9627,plain,
multiply(inverse(sF2_fnc),sF2_fnc) = least_upper_bound(multiply(inverse(sF2_fnc),sF0_fnc),identity),
inference(paramodulation,[status(thm)],[f9526,f210]) ).
fof(f9645,plain,
inverse(multiply(sF3_fnc,sF2_fnc)) = least_upper_bound(multiply(inverse(sF2_fnc),sF0_fnc),identity),
inference(forward_demodulation,[status(thm)],[f473,f9627]) ).
fof(f9646,plain,
inverse(identity) = least_upper_bound(multiply(inverse(sF2_fnc),sF0_fnc),identity),
inference(forward_demodulation,[status(thm)],[f51,f9645]) ).
fof(f9647,plain,
identity = least_upper_bound(multiply(inverse(sF2_fnc),sF0_fnc),identity),
inference(forward_demodulation,[status(thm)],[f35,f9646]) ).
fof(f9648,plain,
identity = least_upper_bound(multiply(sF3_fnc,sF0_fnc),identity),
inference(forward_demodulation,[status(thm)],[f46,f9647]) ).
fof(f13928,plain,
! [X0] : multiply(sF3_fnc,X0) = greatest_lower_bound(X0,multiply(a,X0)),
inference(paramodulation,[status(thm)],[f1026,f365]) ).
fof(f20576,plain,
greatest_lower_bound(identity,multiply(sF3_fnc,sF0_fnc)) = greatest_lower_bound(identity,multiply(a,sF0_fnc)),
inference(paramodulation,[status(thm)],[f13928,f168]) ).
fof(f20632,plain,
greatest_lower_bound(identity,multiply(sF3_fnc,sF0_fnc)) = greatest_lower_bound(identity,least_upper_bound(identity,a)),
inference(forward_demodulation,[status(thm)],[f4876,f20576]) ).
fof(f20633,plain,
greatest_lower_bound(identity,multiply(sF3_fnc,sF0_fnc)) = identity,
inference(forward_demodulation,[status(thm)],[f30,f20632]) ).
fof(f20751,plain,
least_upper_bound(multiply(sF3_fnc,sF0_fnc),identity) = multiply(sF3_fnc,sF0_fnc),
inference(paramodulation,[status(thm)],[f20633,f69]) ).
fof(f20767,plain,
identity = multiply(sF3_fnc,sF0_fnc),
inference(forward_demodulation,[status(thm)],[f9648,f20751]) ).
fof(f20778,plain,
sF0_fnc = multiply(sF2_fnc,identity),
inference(paramodulation,[status(thm)],[f20767,f189]) ).
fof(f20814,plain,
sF0_fnc = sF2_fnc,
inference(forward_demodulation,[status(thm)],[f783,f20778]) ).
fof(f20815,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f20814,f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP179-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.44 % Computer : n016.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.45 % CPULimit : 300
% 0.16/0.45 % WCLimit : 300
% 0.16/0.45 % DateTime : Sun Sep 20 20:09:25 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.46 % Drodi V4.1.1
% 8.94/1.90 % Refutation found
% 8.94/1.90 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 8.94/1.90 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 8.94/1.96 % Elapsed time: 1.491499 seconds
% 8.94/1.96 % CPU time: 11.311904 seconds
% 8.94/1.96 % Total memory used: 114.369 MB
% 8.94/1.96 % Net memory used: 112.379 MB
%------------------------------------------------------------------------------