TSTP Solution File: GRP171-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP171-1 : 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:49 EDT 2023
% Result : Unsatisfiable 1.95s 0.68s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% 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 : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 80 (; 80 !; 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(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(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(f16,hypothesis,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f20,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f21,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f22,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f23,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f24,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(f28,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f29,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f30,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(f32,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(f34,plain,
least_upper_bound(identity,a) = a,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f35,plain,
least_upper_bound(identity,b) = b,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f36,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f194,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X1,X2),multiply(X0,X2)),
inference(paramodulation,[status(thm)],[f23,f32]) ).
fof(f195,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = multiply(least_upper_bound(X1,X0),X2),
inference(forward_demodulation,[status(thm)],[f32,f194]) ).
fof(f200,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X0),X1) = least_upper_bound(X1,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f19,f32]) ).
fof(f460,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(paramodulation,[status(thm)],[f20,f30]) ).
fof(f461,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(forward_demodulation,[status(thm)],[f23,f460]) ).
fof(f466,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f20,f21]) ).
fof(f467,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f19,f466]) ).
fof(f469,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f509,plain,
greatest_lower_bound(identity,b) = identity,
inference(paramodulation,[status(thm)],[f35,f29]) ).
fof(f517,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f554,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f467,f467]) ).
fof(f555,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f20,f467]) ).
fof(f556,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f554,f555]) ).
fof(f652,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f24,f469]) ).
fof(f754,plain,
! [X0] : multiply(X0,inverse(X0)) = identity,
inference(paramodulation,[status(thm)],[f20,f554]) ).
fof(f755,plain,
! [X0] : multiply(X0,identity) = inverse(inverse(X0)),
inference(paramodulation,[status(thm)],[f556,f554]) ).
fof(f756,plain,
! [X0] : X0 = inverse(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f556,f755]) ).
fof(f791,plain,
! [X0,X1] : multiply(least_upper_bound(X0,X1),inverse(least_upper_bound(X1,X0))) = identity,
inference(paramodulation,[status(thm)],[f195,f754]) ).
fof(f1731,plain,
! [X0] : multiply(least_upper_bound(identity,X0),inverse(X0)) = least_upper_bound(inverse(X0),identity),
inference(paramodulation,[status(thm)],[f754,f200]) ).
fof(f1732,plain,
! [X0] : multiply(least_upper_bound(identity,X0),inverse(X0)) = least_upper_bound(identity,inverse(X0)),
inference(forward_demodulation,[status(thm)],[f23,f1731]) ).
fof(f1813,plain,
! [X0] : least_upper_bound(b,greatest_lower_bound(X0,identity)) = b,
inference(paramodulation,[status(thm)],[f509,f652]) ).
fof(f1896,plain,
! [X0] : least_upper_bound(b,greatest_lower_bound(identity,X0)) = b,
inference(paramodulation,[status(thm)],[f22,f1813]) ).
fof(f3161,plain,
multiply(least_upper_bound(a,identity),inverse(a)) = identity,
inference(paramodulation,[status(thm)],[f34,f791]) ).
fof(f3162,plain,
multiply(least_upper_bound(identity,a),inverse(a)) = identity,
inference(forward_demodulation,[status(thm)],[f195,f3161]) ).
fof(f3163,plain,
least_upper_bound(identity,inverse(a)) = identity,
inference(forward_demodulation,[status(thm)],[f1732,f3162]) ).
fof(f4166,plain,
greatest_lower_bound(inverse(a),identity) = inverse(a),
inference(paramodulation,[status(thm)],[f3163,f517]) ).
fof(f4167,plain,
greatest_lower_bound(identity,inverse(a)) = inverse(a),
inference(forward_demodulation,[status(thm)],[f22,f4166]) ).
fof(f4176,plain,
least_upper_bound(b,inverse(a)) = b,
inference(paramodulation,[status(thm)],[f4167,f1896]) ).
fof(f4232,plain,
multiply(inverse(inverse(a)),b) = least_upper_bound(identity,multiply(inverse(inverse(a)),b)),
inference(paramodulation,[status(thm)],[f4176,f461]) ).
fof(f4233,plain,
multiply(a,b) = least_upper_bound(identity,multiply(inverse(inverse(a)),b)),
inference(forward_demodulation,[status(thm)],[f756,f4232]) ).
fof(f4234,plain,
multiply(a,b) = least_upper_bound(identity,multiply(a,b)),
inference(forward_demodulation,[status(thm)],[f756,f4233]) ).
fof(f4235,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f4234,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP171-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 11:46:58 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Drodi V3.5.1
% 1.95/0.68 % Refutation found
% 1.95/0.68 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.95/0.68 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.95/0.70 % Elapsed time: 0.359694 seconds
% 1.95/0.70 % CPU time: 2.045115 seconds
% 1.95/0.70 % Memory used: 28.557 MB
%------------------------------------------------------------------------------