TSTP Solution File: GRP167-5 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP167-5 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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 : Tue Apr 30 20:19:35 EDT 2024
% Result : Unsatisfiable 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 58 unt; 0 def)
% Number of atoms : 58 ( 57 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 : 5 ( 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 : 90 ( 90 !; 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(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(f16,axiom,
! [A,B] : inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [X] : positive_part(X) = least_upper_bound(X,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [X] : negative_part(X) = greatest_lower_bound(X,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f21,negated_conjecture,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f23,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f24,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f25,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f26,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f33,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(f34,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(f35,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(f36,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(f37,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(X1)),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f38,plain,
! [X0] : positive_part(X0) = least_upper_bound(X0,identity),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f39,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(X0,identity),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f42,plain,
a != multiply(positive_part(a),negative_part(a)),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f47,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f23,f24]) ).
fof(f48,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f22,f47]) ).
fof(f57,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(identity,X0),
inference(paramodulation,[status(thm)],[f39,f25]) ).
fof(f96,plain,
! [X0] : positive_part(X0) = least_upper_bound(identity,X0),
inference(paramodulation,[status(thm)],[f38,f26]) ).
fof(f218,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f48,f48]) ).
fof(f219,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f23,f48]) ).
fof(f220,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f218,f219]) ).
fof(f225,plain,
inverse(identity) = identity,
inference(paramodulation,[status(thm)],[f23,f220]) ).
fof(f314,plain,
! [X0] : multiply(X0,identity) = inverse(inverse(X0)),
inference(paramodulation,[status(thm)],[f220,f218]) ).
fof(f315,plain,
! [X0] : X0 = inverse(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f220,f314]) ).
fof(f355,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f220,f33]) ).
fof(f356,plain,
! [X0,X1] : multiply(X0,positive_part(X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f96,f355]) ).
fof(f613,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f220,f34]) ).
fof(f614,plain,
! [X0,X1] : multiply(X0,negative_part(X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f57,f613]) ).
fof(f887,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X0),X1) = least_upper_bound(X1,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f22,f35]) ).
fof(f888,plain,
! [X0,X1] : multiply(positive_part(X0),X1) = least_upper_bound(X1,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f96,f887]) ).
fof(f1080,plain,
! [X0] : multiply(positive_part(X0),X0) = multiply(X0,positive_part(X0)),
inference(paramodulation,[status(thm)],[f356,f888]) ).
fof(f1085,plain,
! [X0] : multiply(positive_part(inverse(X0)),X0) = least_upper_bound(X0,identity),
inference(paramodulation,[status(thm)],[f23,f888]) ).
fof(f1086,plain,
! [X0] : multiply(positive_part(inverse(X0)),X0) = positive_part(X0),
inference(forward_demodulation,[status(thm)],[f38,f1085]) ).
fof(f1140,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X0),X1) = greatest_lower_bound(X1,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f22,f36]) ).
fof(f1141,plain,
! [X0,X1] : multiply(negative_part(X0),X1) = greatest_lower_bound(X1,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f57,f1140]) ).
fof(f1228,plain,
! [X0] : X0 = multiply(inverse(positive_part(inverse(X0))),positive_part(X0)),
inference(paramodulation,[status(thm)],[f1086,f48]) ).
fof(f1251,plain,
! [X0] : multiply(positive_part(X0),negative_part(X0)) = greatest_lower_bound(positive_part(X0),multiply(X0,positive_part(X0))),
inference(paramodulation,[status(thm)],[f1080,f614]) ).
fof(f1252,plain,
! [X0] : multiply(positive_part(X0),negative_part(X0)) = multiply(negative_part(X0),positive_part(X0)),
inference(forward_demodulation,[status(thm)],[f1141,f1251]) ).
fof(f1377,plain,
! [X0] : inverse(least_upper_bound(identity,X0)) = greatest_lower_bound(identity,inverse(X0)),
inference(paramodulation,[status(thm)],[f225,f37]) ).
fof(f1378,plain,
! [X0] : inverse(positive_part(X0)) = greatest_lower_bound(identity,inverse(X0)),
inference(forward_demodulation,[status(thm)],[f96,f1377]) ).
fof(f1379,plain,
! [X0] : inverse(positive_part(X0)) = negative_part(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f57,f1378]) ).
fof(f1413,plain,
! [X0] : inverse(positive_part(inverse(X0))) = negative_part(X0),
inference(paramodulation,[status(thm)],[f315,f1379]) ).
fof(f1430,plain,
! [X0] : X0 = multiply(negative_part(X0),positive_part(X0)),
inference(backward_demodulation,[status(thm)],[f1413,f1228]) ).
fof(f1431,plain,
! [X0] : X0 = multiply(positive_part(X0),negative_part(X0)),
inference(forward_demodulation,[status(thm)],[f1252,f1430]) ).
fof(f1437,plain,
a != a,
inference(backward_demodulation,[status(thm)],[f1431,f42]) ).
fof(f1438,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f1437]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP167-5 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 00:29:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Drodi V3.6.0
% 0.21/0.48 % Refutation found
% 0.21/0.48 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.21/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.51 % Elapsed time: 0.144717 seconds
% 0.21/0.51 % CPU time: 1.048946 seconds
% 0.21/0.51 % Total memory used: 34.038 MB
% 0.21/0.51 % Net memory used: 33.573 MB
%------------------------------------------------------------------------------