TSTP Solution File: GRP181-4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : n015.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:39 EDT 2024
% Result : Unsatisfiable 13.54s 2.09s
% Output : CNFRefutation 14.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 49 ( 49 unt; 0 def)
% Number of atoms : 49 ( 48 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 : 5 ( 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 : 76 ( 76 !; 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(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(f17,hypothesis,
! [X] : inverse(inverse(X)) = 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(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(f40,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f17]) ).
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(f69,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f25,f26]) ).
fof(f70,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f24,f69]) ).
fof(f350,plain,
! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X2),multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f28,f35]) ).
fof(f351,plain,
! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = multiply(X0,least_upper_bound(X2,X1)),
inference(forward_demodulation,[status(thm)],[f35,f350]) ).
fof(f361,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(f472,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(X0,inverse(X1)),
inference(paramodulation,[status(thm)],[f40,f45]) ).
fof(f473,plain,
! [X0,X1] : inverse(least_upper_bound(X0,inverse(X1))) = greatest_lower_bound(inverse(X0),X1),
inference(paramodulation,[status(thm)],[f40,f45]) ).
fof(f932,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(f949,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(multiply(X0,X1),identity),
inference(paramodulation,[status(thm)],[f25,f37]) ).
fof(f950,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f28,f949]) ).
fof(f5860,plain,
! [X0,X1] : X0 = multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(X1,X0))),
inference(paramodulation,[status(thm)],[f932,f70]) ).
fof(f5861,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(X0,inverse(X1)),least_upper_bound(identity,multiply(X1,X0))),
inference(forward_demodulation,[status(thm)],[f472,f5860]) ).
fof(f5926,plain,
! [X0,X1] : X0 = multiply(inverse(least_upper_bound(X1,inverse(X0))),least_upper_bound(identity,multiply(X1,X0))),
inference(paramodulation,[status(thm)],[f950,f70]) ).
fof(f5927,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(inverse(X1),X0),least_upper_bound(identity,multiply(X1,X0))),
inference(forward_demodulation,[status(thm)],[f473,f5926]) ).
fof(f6108,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(X0,X1),least_upper_bound(identity,multiply(inverse(X1),X0))),
inference(paramodulation,[status(thm)],[f40,f5861]) ).
fof(f6653,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(X1,X0),least_upper_bound(identity,multiply(inverse(X1),X0))),
inference(paramodulation,[status(thm)],[f40,f5927]) ).
fof(f14425,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(X1,X0),multiply(inverse(X1),least_upper_bound(X1,X0))),
inference(paramodulation,[status(thm)],[f361,f6653]) ).
fof(f14426,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(X0,X1),multiply(inverse(X1),least_upper_bound(X1,X0))),
inference(paramodulation,[status(thm)],[f361,f6108]) ).
fof(f14795,plain,
b = multiply(greatest_lower_bound(a,c),multiply(inverse(c),least_upper_bound(c,b))),
inference(paramodulation,[status(thm)],[f47,f14425]) ).
fof(f14796,plain,
b = multiply(greatest_lower_bound(a,c),multiply(inverse(c),least_upper_bound(a,c))),
inference(forward_demodulation,[status(thm)],[f48,f14795]) ).
fof(f15160,plain,
! [X0,X1] : X0 = multiply(greatest_lower_bound(X0,X1),multiply(inverse(X1),least_upper_bound(X0,X1))),
inference(paramodulation,[status(thm)],[f351,f14426]) ).
fof(f15366,plain,
b = a,
inference(backward_demodulation,[status(thm)],[f15160,f14796]) ).
fof(f15367,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f15366,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP181-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 00:38:32 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.6.0
% 13.54/2.09 % Refutation found
% 13.54/2.09 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 13.54/2.09 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 14.12/2.18 % Elapsed time: 1.813112 seconds
% 14.12/2.18 % CPU time: 14.081533 seconds
% 14.12/2.18 % Total memory used: 216.956 MB
% 14.12/2.18 % Net memory used: 214.335 MB
%------------------------------------------------------------------------------