TSTP Solution File: GRP167-2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP167-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 31 12:10:48 EDT 2023
% Result : Unsatisfiable 49.35s 6.61s
% Output : CNFRefutation 50.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 18
% Syntax : Number of formulae : 140 ( 140 unt; 0 def)
% Number of atoms : 140 ( 139 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 221 (; 221 !; 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(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(f12,axiom,
! [X,Y,Z] : multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
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(f14,axiom,
! [Y,Z,X] : multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [X] : inverse(inverse(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [X] : positive_part(X) = least_upper_bound(X,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [X] : negative_part(X) = greatest_lower_bound(X,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f21,axiom,
! [X,Y,Z] : least_upper_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f25,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f26,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f27,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f29,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(esa)],[f6]) ).
fof(f30,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(esa)],[f7]) ).
fof(f33,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f34,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f35,plain,
! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f36,plain,
! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f37,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f38,plain,
! [X0,X1,X2] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f40,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f42,plain,
! [X0] : positive_part(X0) = least_upper_bound(X0,identity),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f43,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(X0,identity),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f44,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X0,X2)),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f46,plain,
a != multiply(positive_part(a),negative_part(a)),
inference(cnf_transformation,[status(esa)],[f23]) ).
fof(f56,plain,
! [X0] : multiply(X0,inverse(X0)) = identity,
inference(paramodulation,[status(thm)],[f40,f25]) ).
fof(f58,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f25,f26]) ).
fof(f59,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f24,f58]) ).
fof(f60,plain,
! [X0,X1] : X0 = multiply(X1,multiply(inverse(X1),X0)),
inference(paramodulation,[status(thm)],[f40,f59]) ).
fof(f64,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f25,f59]) ).
fof(f65,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f40,f64]) ).
fof(f68,plain,
! [X0,X1,X2] : X0 = multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X2,X0))),
inference(paramodulation,[status(thm)],[f26,f59]) ).
fof(f136,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(identity,X0),
inference(paramodulation,[status(thm)],[f43,f27]) ).
fof(f140,plain,
! [X0] : positive_part(X0) = least_upper_bound(identity,X0),
inference(paramodulation,[status(thm)],[f42,f28]) ).
fof(f144,plain,
! [X0] : least_upper_bound(X0,negative_part(X0)) = X0,
inference(paramodulation,[status(thm)],[f43,f33]) ).
fof(f145,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f27,f33]) ).
fof(f152,plain,
! [X0] : greatest_lower_bound(X0,positive_part(X0)) = X0,
inference(paramodulation,[status(thm)],[f42,f34]) ).
fof(f153,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f28,f34]) ).
fof(f168,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(multiply(X1,X0)),multiply(X1,identity)),
inference(paramodulation,[status(thm)],[f56,f68]) ).
fof(f169,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(multiply(X1,X0)),X1),
inference(forward_demodulation,[status(thm)],[f65,f168]) ).
fof(f191,plain,
! [X0] : positive_part(greatest_lower_bound(identity,X0)) = identity,
inference(paramodulation,[status(thm)],[f33,f140]) ).
fof(f192,plain,
! [X0] : positive_part(negative_part(X0)) = identity,
inference(forward_demodulation,[status(thm)],[f136,f191]) ).
fof(f200,plain,
! [X0] : greatest_lower_bound(identity,positive_part(X0)) = identity,
inference(paramodulation,[status(thm)],[f140,f34]) ).
fof(f201,plain,
! [X0] : negative_part(positive_part(X0)) = identity,
inference(forward_demodulation,[status(thm)],[f136,f200]) ).
fof(f206,plain,
! [X0] : greatest_lower_bound(negative_part(X0),identity) = negative_part(X0),
inference(paramodulation,[status(thm)],[f192,f152]) ).
fof(f207,plain,
! [X0] : negative_part(negative_part(X0)) = negative_part(X0),
inference(forward_demodulation,[status(thm)],[f43,f206]) ).
fof(f239,plain,
! [X0,X1] : least_upper_bound(X0,least_upper_bound(X1,identity)) = positive_part(least_upper_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f42,f30]) ).
fof(f240,plain,
! [X0,X1] : least_upper_bound(X0,positive_part(X1)) = positive_part(least_upper_bound(X0,X1)),
inference(forward_demodulation,[status(thm)],[f42,f239]) ).
fof(f247,plain,
! [X0,X1] : least_upper_bound(identity,least_upper_bound(X0,X1)) = least_upper_bound(positive_part(X0),X1),
inference(paramodulation,[status(thm)],[f140,f30]) ).
fof(f248,plain,
! [X0,X1] : positive_part(least_upper_bound(X0,X1)) = least_upper_bound(positive_part(X0),X1),
inference(forward_demodulation,[status(thm)],[f140,f247]) ).
fof(f273,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(paramodulation,[status(thm)],[f25,f35]) ).
fof(f274,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = positive_part(multiply(inverse(X0),X1)),
inference(forward_demodulation,[status(thm)],[f140,f273]) ).
fof(f284,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f65,f35]) ).
fof(f285,plain,
! [X0,X1] : multiply(X0,positive_part(X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f140,f284]) ).
fof(f312,plain,
! [X0] : least_upper_bound(positive_part(X0),identity) = positive_part(X0),
inference(paramodulation,[status(thm)],[f201,f144]) ).
fof(f313,plain,
! [X0] : positive_part(positive_part(X0)) = positive_part(X0),
inference(forward_demodulation,[status(thm)],[f42,f312]) ).
fof(f469,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(inverse(X1)),inverse(multiply(X0,X1))),
inference(paramodulation,[status(thm)],[f169,f169]) ).
fof(f470,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(forward_demodulation,[status(thm)],[f40,f469]) ).
fof(f557,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f29,f145]) ).
fof(f788,plain,
! [X0,X1] : least_upper_bound(positive_part(X0),greatest_lower_bound(X1,X0)) = positive_part(X0),
inference(paramodulation,[status(thm)],[f152,f557]) ).
fof(f977,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(paramodulation,[status(thm)],[f25,f36]) ).
fof(f978,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = negative_part(multiply(inverse(X0),X1)),
inference(forward_demodulation,[status(thm)],[f136,f977]) ).
fof(f988,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f65,f36]) ).
fof(f989,plain,
! [X0,X1] : multiply(X0,negative_part(X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f136,f988]) ).
fof(f1033,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f25,f37]) ).
fof(f1034,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = positive_part(multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f140,f1033]) ).
fof(f1038,plain,
! [X0,X1] : multiply(least_upper_bound(X0,X1),inverse(X0)) = least_upper_bound(identity,multiply(X1,inverse(X0))),
inference(paramodulation,[status(thm)],[f56,f37]) ).
fof(f1039,plain,
! [X0,X1] : multiply(least_upper_bound(X0,X1),inverse(X0)) = positive_part(multiply(X1,inverse(X0))),
inference(forward_demodulation,[status(thm)],[f140,f1038]) ).
fof(f1089,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X0),X1) = greatest_lower_bound(X1,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f24,f38]) ).
fof(f1090,plain,
! [X0,X1] : multiply(negative_part(X0),X1) = greatest_lower_bound(X1,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f136,f1089]) ).
fof(f1237,plain,
! [X0,X1] : least_upper_bound(X0,positive_part(X1)) = positive_part(least_upper_bound(X1,X0)),
inference(paramodulation,[status(thm)],[f28,f240]) ).
fof(f1238,plain,
! [X0,X1] : least_upper_bound(X0,positive_part(X1)) = least_upper_bound(X1,positive_part(X0)),
inference(forward_demodulation,[status(thm)],[f240,f1237]) ).
fof(f1338,plain,
! [X0,X1] : least_upper_bound(X0,positive_part(X1)) = least_upper_bound(positive_part(X0),X1),
inference(forward_demodulation,[status(thm)],[f240,f248]) ).
fof(f1453,plain,
! [X0] : multiply(inverse(X0),X0) = positive_part(multiply(inverse(X0),negative_part(X0))),
inference(paramodulation,[status(thm)],[f144,f274]) ).
fof(f1454,plain,
! [X0] : identity = positive_part(multiply(inverse(X0),negative_part(X0))),
inference(forward_demodulation,[status(thm)],[f25,f1453]) ).
fof(f1463,plain,
! [X0] : multiply(inverse(X0),positive_part(X0)) = positive_part(multiply(inverse(X0),identity)),
inference(paramodulation,[status(thm)],[f42,f274]) ).
fof(f1464,plain,
! [X0] : multiply(inverse(X0),positive_part(X0)) = positive_part(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f65,f1463]) ).
fof(f1470,plain,
! [X0,X1] : least_upper_bound(X0,X1) = multiply(X0,positive_part(multiply(inverse(X0),X1))),
inference(paramodulation,[status(thm)],[f274,f60]) ).
fof(f2006,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(positive_part(X0),least_upper_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f42,f44]) ).
fof(f2007,plain,
! [X0,X1] : least_upper_bound(X0,negative_part(X1)) = greatest_lower_bound(positive_part(X0),least_upper_bound(X0,X1)),
inference(forward_demodulation,[status(thm)],[f136,f2006]) ).
fof(f2263,plain,
! [X0] : multiply(inverse(X0),X0) = negative_part(multiply(inverse(X0),positive_part(X0))),
inference(paramodulation,[status(thm)],[f152,f978]) ).
fof(f2264,plain,
! [X0] : identity = negative_part(multiply(inverse(X0),positive_part(X0))),
inference(forward_demodulation,[status(thm)],[f25,f2263]) ).
fof(f2467,plain,
! [X0,X1] : least_upper_bound(X0,positive_part(greatest_lower_bound(X1,X0))) = positive_part(X0),
inference(forward_demodulation,[status(thm)],[f1338,f788]) ).
fof(f2772,plain,
! [X0] : multiply(positive_part(inverse(X0)),X0) = positive_part(multiply(identity,X0)),
inference(paramodulation,[status(thm)],[f42,f1034]) ).
fof(f2773,plain,
! [X0] : multiply(positive_part(inverse(X0)),X0) = positive_part(X0),
inference(forward_demodulation,[status(thm)],[f24,f2772]) ).
fof(f2835,plain,
! [X0] : X0 = multiply(inverse(positive_part(inverse(X0))),positive_part(X0)),
inference(paramodulation,[status(thm)],[f2773,f59]) ).
fof(f2985,plain,
! [X0] : identity = positive_part(multiply(inverse(positive_part(X0)),identity)),
inference(paramodulation,[status(thm)],[f201,f1454]) ).
fof(f2986,plain,
! [X0] : identity = positive_part(inverse(positive_part(X0))),
inference(forward_demodulation,[status(thm)],[f65,f2985]) ).
fof(f3106,plain,
! [X0] : identity = negative_part(multiply(inverse(negative_part(X0)),identity)),
inference(paramodulation,[status(thm)],[f192,f2264]) ).
fof(f3107,plain,
! [X0] : identity = negative_part(inverse(negative_part(X0))),
inference(forward_demodulation,[status(thm)],[f65,f3106]) ).
fof(f3560,plain,
! [X0] : least_upper_bound(inverse(negative_part(X0)),identity) = inverse(negative_part(X0)),
inference(paramodulation,[status(thm)],[f3107,f144]) ).
fof(f3561,plain,
! [X0] : positive_part(inverse(negative_part(X0))) = inverse(negative_part(X0)),
inference(forward_demodulation,[status(thm)],[f42,f3560]) ).
fof(f6638,plain,
! [X0] : multiply(negative_part(inverse(X0)),X0) = greatest_lower_bound(X0,identity),
inference(paramodulation,[status(thm)],[f25,f1090]) ).
fof(f6639,plain,
! [X0] : multiply(negative_part(inverse(X0)),X0) = negative_part(X0),
inference(forward_demodulation,[status(thm)],[f43,f6638]) ).
fof(f6748,plain,
! [X0] : X0 = multiply(inverse(negative_part(inverse(X0))),negative_part(X0)),
inference(paramodulation,[status(thm)],[f6639,f59]) ).
fof(f7239,plain,
! [X0] : inverse(inverse(X0)) = multiply(positive_part(X0),inverse(positive_part(inverse(X0)))),
inference(paramodulation,[status(thm)],[f1464,f470]) ).
fof(f7240,plain,
! [X0] : X0 = multiply(positive_part(X0),inverse(positive_part(inverse(X0)))),
inference(forward_demodulation,[status(thm)],[f40,f7239]) ).
fof(f8209,plain,
! [X0] : multiply(inverse(positive_part(inverse(X0))),positive_part(positive_part(X0))) = least_upper_bound(inverse(positive_part(inverse(X0))),X0),
inference(paramodulation,[status(thm)],[f2835,f285]) ).
fof(f8210,plain,
! [X0] : multiply(inverse(positive_part(inverse(X0))),positive_part(X0)) = least_upper_bound(inverse(positive_part(inverse(X0))),X0),
inference(forward_demodulation,[status(thm)],[f313,f8209]) ).
fof(f8211,plain,
! [X0] : X0 = least_upper_bound(inverse(positive_part(inverse(X0))),X0),
inference(forward_demodulation,[status(thm)],[f2835,f8210]) ).
fof(f8212,plain,
! [X0] : X0 = least_upper_bound(X0,inverse(positive_part(inverse(X0)))),
inference(forward_demodulation,[status(thm)],[f28,f8211]) ).
fof(f9932,plain,
! [X0,X1] : least_upper_bound(X0,negative_part(X1)) = greatest_lower_bound(positive_part(X0),least_upper_bound(X1,X0)),
inference(paramodulation,[status(thm)],[f28,f2007]) ).
fof(f10824,plain,
! [X0] : multiply(inverse(negative_part(inverse(X0))),negative_part(negative_part(X0))) = greatest_lower_bound(inverse(negative_part(inverse(X0))),X0),
inference(paramodulation,[status(thm)],[f6748,f989]) ).
fof(f10825,plain,
! [X0] : multiply(inverse(negative_part(inverse(X0))),negative_part(X0)) = greatest_lower_bound(inverse(negative_part(inverse(X0))),X0),
inference(forward_demodulation,[status(thm)],[f207,f10824]) ).
fof(f10826,plain,
! [X0] : X0 = greatest_lower_bound(inverse(negative_part(inverse(X0))),X0),
inference(forward_demodulation,[status(thm)],[f6748,f10825]) ).
fof(f10827,plain,
! [X0] : X0 = greatest_lower_bound(X0,inverse(negative_part(inverse(X0)))),
inference(forward_demodulation,[status(thm)],[f27,f10826]) ).
fof(f10878,plain,
! [X0] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(negative_part(X0))),
inference(paramodulation,[status(thm)],[f40,f10827]) ).
fof(f13626,plain,
! [X0] : least_upper_bound(inverse(negative_part(X0)),positive_part(inverse(X0))) = positive_part(inverse(negative_part(X0))),
inference(paramodulation,[status(thm)],[f10878,f2467]) ).
fof(f13627,plain,
! [X0] : least_upper_bound(inverse(X0),positive_part(inverse(negative_part(X0)))) = positive_part(inverse(negative_part(X0))),
inference(forward_demodulation,[status(thm)],[f1238,f13626]) ).
fof(f13628,plain,
! [X0] : least_upper_bound(inverse(X0),inverse(negative_part(X0))) = positive_part(inverse(negative_part(X0))),
inference(forward_demodulation,[status(thm)],[f3561,f13627]) ).
fof(f13629,plain,
! [X0] : least_upper_bound(inverse(X0),inverse(negative_part(X0))) = inverse(negative_part(X0)),
inference(forward_demodulation,[status(thm)],[f3561,f13628]) ).
fof(f34260,plain,
! [X0,X1] : multiply(X0,inverse(X0)) = positive_part(multiply(greatest_lower_bound(X1,X0),inverse(X0))),
inference(paramodulation,[status(thm)],[f145,f1039]) ).
fof(f34261,plain,
! [X0,X1] : identity = positive_part(multiply(greatest_lower_bound(X0,X1),inverse(X1))),
inference(forward_demodulation,[status(thm)],[f56,f34260]) ).
fof(f34497,plain,
! [X0,X1] : identity = positive_part(multiply(X0,inverse(least_upper_bound(X1,X0)))),
inference(paramodulation,[status(thm)],[f153,f34261]) ).
fof(f66332,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))) = multiply(X0,identity),
inference(paramodulation,[status(thm)],[f34497,f1470]) ).
fof(f66333,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))) = X0,
inference(forward_demodulation,[status(thm)],[f65,f66332]) ).
fof(f110875,plain,
! [X0] : least_upper_bound(inverse(positive_part(inverse(X0))),negative_part(X0)) = greatest_lower_bound(positive_part(inverse(positive_part(inverse(X0)))),X0),
inference(paramodulation,[status(thm)],[f8212,f9932]) ).
fof(f110876,plain,
! [X0] : least_upper_bound(negative_part(X0),inverse(positive_part(inverse(X0)))) = greatest_lower_bound(positive_part(inverse(positive_part(inverse(X0)))),X0),
inference(forward_demodulation,[status(thm)],[f28,f110875]) ).
fof(f110877,plain,
! [X0] : least_upper_bound(negative_part(X0),inverse(positive_part(inverse(X0)))) = greatest_lower_bound(X0,positive_part(inverse(positive_part(inverse(X0))))),
inference(forward_demodulation,[status(thm)],[f27,f110876]) ).
fof(f110878,plain,
! [X0] : least_upper_bound(negative_part(X0),inverse(positive_part(inverse(X0)))) = greatest_lower_bound(X0,identity),
inference(forward_demodulation,[status(thm)],[f2986,f110877]) ).
fof(f110879,plain,
! [X0] : least_upper_bound(negative_part(X0),inverse(positive_part(inverse(X0)))) = negative_part(X0),
inference(forward_demodulation,[status(thm)],[f43,f110878]) ).
fof(f206644,plain,
! [X0] : least_upper_bound(positive_part(inverse(X0)),inverse(negative_part(X0))) = positive_part(inverse(X0)),
inference(paramodulation,[status(thm)],[f110879,f66333]) ).
fof(f206645,plain,
! [X0] : least_upper_bound(inverse(X0),positive_part(inverse(negative_part(X0)))) = positive_part(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f1338,f206644]) ).
fof(f206646,plain,
! [X0] : least_upper_bound(inverse(X0),inverse(negative_part(X0))) = positive_part(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f3561,f206645]) ).
fof(f206647,plain,
! [X0] : inverse(negative_part(X0)) = positive_part(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f13629,f206646]) ).
fof(f207002,plain,
! [X0] : X0 = multiply(positive_part(X0),inverse(inverse(negative_part(X0)))),
inference(backward_demodulation,[status(thm)],[f206647,f7240]) ).
fof(f207003,plain,
! [X0] : X0 = multiply(positive_part(X0),negative_part(X0)),
inference(forward_demodulation,[status(thm)],[f40,f207002]) ).
fof(f207233,plain,
a != a,
inference(backward_demodulation,[status(thm)],[f207003,f46]) ).
fof(f207234,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f207233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP167-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.02/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.30 % Computer : n026.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % WCLimit : 300
% 0.08/0.30 % DateTime : Tue May 30 11:42:13 EDT 2023
% 0.08/0.31 % CPUTime :
% 0.13/0.31 % Drodi V3.5.1
% 49.35/6.61 % Refutation found
% 49.35/6.61 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 49.35/6.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 51.54/6.85 % Elapsed time: 6.518647 seconds
% 51.54/6.85 % CPU time: 50.764360 seconds
% 51.54/6.85 % Memory used: 637.000 MB
%------------------------------------------------------------------------------