TSTP Solution File: GRP185-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP185-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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:40 EDT 2024
% Result : Unsatisfiable 98.78s 12.74s
% Output : CNFRefutation 99.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 63 ( 63 unt; 0 def)
% Number of atoms : 63 ( 62 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 11 ( 11 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 133 ( 133 !; 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(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/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,negated_conjecture,
least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f18,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f19,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f20,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f21,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f22,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(f23,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(f26,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f27,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f28,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(f30,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(f32,plain,
least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f33,plain,
least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
inference(forward_demodulation,[status(thm)],[f23,f32]) ).
fof(f34,plain,
least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(identity,a),least_upper_bound(b,identity)))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
inference(forward_demodulation,[status(thm)],[f21,f33]) ).
fof(f35,plain,
least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
inference(forward_demodulation,[status(thm)],[f21,f34]) ).
fof(f36,plain,
least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)))) != multiply(least_upper_bound(identity,a),least_upper_bound(b,identity)),
inference(forward_demodulation,[status(thm)],[f21,f35]) ).
fof(f37,plain,
least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)))) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),
inference(forward_demodulation,[status(thm)],[f21,f36]) ).
fof(f41,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f18,f19]) ).
fof(f42,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f17,f41]) ).
fof(f44,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f20,f26]) ).
fof(f48,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f21,f27]) ).
fof(f86,plain,
! [X0,X1,X2] : least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f22,f44]) ).
fof(f93,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f42,f42]) ).
fof(f94,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f18,f42]) ).
fof(f95,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f93,f94]) ).
fof(f144,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(paramodulation,[status(thm)],[f21,f23]) ).
fof(f156,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X1,X0),X2),
inference(paramodulation,[status(thm)],[f21,f23]) ).
fof(f157,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(forward_demodulation,[status(thm)],[f23,f156]) ).
fof(f169,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X2,X0))) = X0,
inference(paramodulation,[status(thm)],[f23,f48]) ).
fof(f241,plain,
! [X0,X1,X2] : least_upper_bound(least_upper_bound(X0,X1),greatest_lower_bound(X2,X0)) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f27,f86]) ).
fof(f242,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(X2,X0))) = least_upper_bound(X0,X1),
inference(forward_demodulation,[status(thm)],[f23,f241]) ).
fof(f259,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,least_upper_bound(least_upper_bound(X1,X0),X2)) = X0,
inference(paramodulation,[status(thm)],[f21,f169]) ).
fof(f260,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))) = X0,
inference(forward_demodulation,[status(thm)],[f23,f259]) ).
fof(f333,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f95,f28]) ).
fof(f346,plain,
! [X0,X1,X2,X3] : greatest_lower_bound(multiply(X0,X1),least_upper_bound(X2,multiply(X0,least_upper_bound(X3,X1)))) = multiply(X0,X1),
inference(paramodulation,[status(thm)],[f28,f169]) ).
fof(f572,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X1,X0)),
inference(paramodulation,[status(thm)],[f21,f144]) ).
fof(f990,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X1,X2),multiply(X0,X2)),
inference(paramodulation,[status(thm)],[f21,f30]) ).
fof(f991,plain,
! [X0,X1,X2] : multiply(least_upper_bound(X0,X1),X2) = multiply(least_upper_bound(X1,X0),X2),
inference(forward_demodulation,[status(thm)],[f30,f990]) ).
fof(f2013,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,least_upper_bound(X1,multiply(X0,least_upper_bound(identity,X2)))) = X0,
inference(paramodulation,[status(thm)],[f333,f260]) ).
fof(f2158,plain,
least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)))) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),
inference(paramodulation,[status(thm)],[f157,f37]) ).
fof(f2163,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,multiply(least_upper_bound(X1,X0),least_upper_bound(identity,X2))) = X0,
inference(paramodulation,[status(thm)],[f30,f2013]) ).
fof(f2310,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,multiply(least_upper_bound(X0,X1),least_upper_bound(identity,X2))) = X0,
inference(paramodulation,[status(thm)],[f991,f2163]) ).
fof(f2898,plain,
! [X0,X1,X2,X3] : least_upper_bound(multiply(least_upper_bound(X0,X1),least_upper_bound(identity,X2)),least_upper_bound(X3,X0)) = least_upper_bound(multiply(least_upper_bound(X0,X1),least_upper_bound(identity,X2)),X3),
inference(paramodulation,[status(thm)],[f2310,f242]) ).
fof(f2899,plain,
! [X0,X1,X2,X3] : least_upper_bound(X0,least_upper_bound(X1,multiply(least_upper_bound(X0,X2),least_upper_bound(identity,X3)))) = least_upper_bound(multiply(least_upper_bound(X0,X2),least_upper_bound(identity,X3)),X1),
inference(forward_demodulation,[status(thm)],[f572,f2898]) ).
fof(f2909,plain,
least_upper_bound(multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),multiply(a,b)) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),
inference(backward_demodulation,[status(thm)],[f2899,f2158]) ).
fof(f2910,plain,
least_upper_bound(multiply(a,b),multiply(least_upper_bound(identity,a),least_upper_bound(identity,b))) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),
inference(forward_demodulation,[status(thm)],[f21,f2909]) ).
fof(f26548,plain,
! [X0,X1,X2,X3] : greatest_lower_bound(multiply(X0,X1),multiply(least_upper_bound(X2,X0),least_upper_bound(X3,X1))) = multiply(X0,X1),
inference(paramodulation,[status(thm)],[f30,f346]) ).
fof(f73355,plain,
! [X0,X1,X2,X3] : least_upper_bound(multiply(least_upper_bound(X0,X1),least_upper_bound(X2,X3)),multiply(X1,X3)) = multiply(least_upper_bound(X0,X1),least_upper_bound(X2,X3)),
inference(paramodulation,[status(thm)],[f26548,f44]) ).
fof(f73356,plain,
! [X0,X1,X2,X3] : least_upper_bound(multiply(X0,X1),multiply(least_upper_bound(X2,X0),least_upper_bound(X3,X1))) = multiply(least_upper_bound(X2,X0),least_upper_bound(X3,X1)),
inference(forward_demodulation,[status(thm)],[f21,f73355]) ).
fof(f73360,plain,
multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)) != multiply(least_upper_bound(identity,a),least_upper_bound(identity,b)),
inference(backward_demodulation,[status(thm)],[f73356,f2910]) ).
fof(f73361,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f73360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : GRP185-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29 % Computer : n010.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue Apr 30 00:18:50 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.08/0.29 % Drodi V3.6.0
% 98.78/12.74 % Refutation found
% 98.78/12.74 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 98.78/12.74 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 100.53/13.01 % Elapsed time: 12.694333 seconds
% 100.53/13.01 % CPU time: 100.002906 seconds
% 100.53/13.01 % Total memory used: 1.110 GB
% 100.53/13.01 % Net memory used: 1.102 GB
%------------------------------------------------------------------------------