TSTP Solution File: GRP181-4 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP181-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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:53 EDT 2023
% Result : Unsatisfiable 82.70s 10.93s
% Output : CNFRefutation 84.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 55 ( 55 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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; 4 con; 0-2 aty)
% Number of variables : 82 (; 82 !; 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(f16,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
! [X] : inverse(inverse(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,hypothesis,
! [X,Y] : inverse(multiply(X,Y)) = multiply(inverse(Y),inverse(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,hypothesis,
! [X,Y] : inverse(least_upper_bound(X,Y)) = greatest_lower_bound(inverse(X),inverse(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
a != b,
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(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(f39,plain,
inverse(identity) = identity,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f40,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f41,plain,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f42,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f43,plain,
least_upper_bound(a,c) = least_upper_bound(b,c),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f45,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(X1)),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f46,plain,
a != b,
inference(cnf_transformation,[status(esa)],[f23]) ).
fof(f47,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(c,b),
inference(forward_demodulation,[status(thm)],[f27,f42]) ).
fof(f48,plain,
least_upper_bound(a,c) = least_upper_bound(c,b),
inference(forward_demodulation,[status(thm)],[f28,f43]) ).
fof(f51,plain,
! [X0] : multiply(X0,inverse(X0)) = identity,
inference(paramodulation,[status(thm)],[f40,f25]) ).
fof(f72,plain,
! [X0,X1] : multiply(identity,X0) = multiply(X1,multiply(inverse(X1),X0)),
inference(paramodulation,[status(thm)],[f51,f26]) ).
fof(f73,plain,
! [X0,X1] : X0 = multiply(X1,multiply(inverse(X1),X0)),
inference(forward_demodulation,[status(thm)],[f24,f72]) ).
fof(f413,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(f494,plain,
! [X0,X1] : inverse(multiply(inverse(X0),X1)) = multiply(inverse(X1),X0),
inference(paramodulation,[status(thm)],[f40,f41]) ).
fof(f497,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(paramodulation,[status(thm)],[f41,f73]) ).
fof(f560,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(f573,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(multiply(inverse(X0),X1),identity),
inference(paramodulation,[status(thm)],[f25,f36]) ).
fof(f574,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(forward_demodulation,[status(thm)],[f27,f573]) ).
fof(f724,plain,
! [X0] : inverse(least_upper_bound(identity,X0)) = greatest_lower_bound(identity,inverse(X0)),
inference(paramodulation,[status(thm)],[f39,f45]) ).
fof(f815,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X1,X2),multiply(X0,X2)),
inference(paramodulation,[status(thm)],[f28,f37]) ).
fof(f816,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = multiply(least_upper_bound(X1,X0),X2),
inference(forward_demodulation,[status(thm)],[f37,f815]) ).
fof(f4823,plain,
! [X0,X1] : inverse(least_upper_bound(identity,multiply(inverse(X0),X1))) = greatest_lower_bound(identity,multiply(inverse(X1),X0)),
inference(paramodulation,[status(thm)],[f494,f724]) ).
fof(f6869,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(least_upper_bound(X0,X1),inverse(least_upper_bound(identity,multiply(inverse(X0),X1)))),
inference(paramodulation,[status(thm)],[f413,f497]) ).
fof(f6870,plain,
! [X0,X1] : X0 = multiply(least_upper_bound(X0,X1),inverse(least_upper_bound(identity,multiply(inverse(X0),X1)))),
inference(forward_demodulation,[status(thm)],[f40,f6869]) ).
fof(f6871,plain,
! [X0,X1] : X0 = multiply(least_upper_bound(X0,X1),greatest_lower_bound(identity,multiply(inverse(X1),X0))),
inference(forward_demodulation,[status(thm)],[f4823,f6870]) ).
fof(f72097,plain,
! [X0,X1] : X0 = multiply(least_upper_bound(X0,X1),multiply(inverse(X1),greatest_lower_bound(X0,X1))),
inference(paramodulation,[status(thm)],[f574,f6871]) ).
fof(f72098,plain,
! [X0,X1] : X0 = multiply(least_upper_bound(X0,X1),multiply(inverse(X1),greatest_lower_bound(X1,X0))),
inference(paramodulation,[status(thm)],[f560,f6871]) ).
fof(f74615,plain,
b = multiply(least_upper_bound(b,c),multiply(inverse(c),greatest_lower_bound(a,c))),
inference(paramodulation,[status(thm)],[f47,f72098]) ).
fof(f74616,plain,
b = multiply(least_upper_bound(c,b),multiply(inverse(c),greatest_lower_bound(a,c))),
inference(forward_demodulation,[status(thm)],[f816,f74615]) ).
fof(f74617,plain,
b = multiply(least_upper_bound(a,c),multiply(inverse(c),greatest_lower_bound(a,c))),
inference(forward_demodulation,[status(thm)],[f48,f74616]) ).
fof(f74618,plain,
b = a,
inference(forward_demodulation,[status(thm)],[f72097,f74617]) ).
fof(f74619,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f74618,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP181-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31 % Computer : n029.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue May 30 11:42:06 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 82.70/10.93 % Refutation found
% 82.70/10.93 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 82.70/10.93 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 84.91/11.17 % Elapsed time: 10.837839 seconds
% 84.91/11.17 % CPU time: 84.328635 seconds
% 84.91/11.17 % Memory used: 886.660 MB
%------------------------------------------------------------------------------