TSTP Solution File: GRP190-2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP190-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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:56 EDT 2023
% Result : Unsatisfiable 2.95s 0.83s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 48 unt; 0 def)
% Number of atoms : 48 ( 47 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 79 (; 79 !; 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(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(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,plain,
! [X0] : multiply(identity,X0) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f19,plain,
! [X0] : multiply(inverse(X0),X0) = identity,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f20,plain,
! [X0,X1,X2] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f21,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f22,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f27,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f28,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f29,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(f31,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(f33,plain,
least_upper_bound(a,b) = a,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f34,plain,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f38,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f19,f20]) ).
fof(f39,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f18,f38]) ).
fof(f41,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f21,f27]) ).
fof(f50,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f53,plain,
! [X0,X1] : least_upper_bound(least_upper_bound(X0,X1),X0) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f28,f41]) ).
fof(f54,plain,
! [X0,X1] : least_upper_bound(X0,least_upper_bound(X0,X1)) = least_upper_bound(X0,X1),
inference(forward_demodulation,[status(thm)],[f22,f53]) ).
fof(f87,plain,
! [X0,X1] : least_upper_bound(least_upper_bound(X0,X1),X1) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f50,f41]) ).
fof(f88,plain,
! [X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X0)) = least_upper_bound(X1,X0),
inference(forward_demodulation,[status(thm)],[f22,f87]) ).
fof(f95,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f39,f39]) ).
fof(f96,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f19,f39]) ).
fof(f97,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f95,f96]) ).
fof(f138,plain,
! [X0] : multiply(X0,identity) = inverse(inverse(X0)),
inference(paramodulation,[status(thm)],[f97,f95]) ).
fof(f139,plain,
! [X0] : X0 = inverse(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f97,f138]) ).
fof(f223,plain,
! [X0,X1,X2] : multiply(inverse(X0),least_upper_bound(X1,multiply(X0,X2))) = least_upper_bound(multiply(inverse(X0),X1),X2),
inference(paramodulation,[status(thm)],[f39,f29]) ).
fof(f638,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f19,f31]) ).
fof(f957,plain,
! [X0,X1] : X0 = multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(X1,X0))),
inference(paramodulation,[status(thm)],[f638,f39]) ).
fof(f3899,plain,
! [X0,X1] : X0 = multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(least_upper_bound(inverse(X0),X1),X0))),
inference(paramodulation,[status(thm)],[f54,f957]) ).
fof(f3900,plain,
! [X0,X1] : X0 = least_upper_bound(multiply(inverse(least_upper_bound(inverse(X0),X1)),identity),X0),
inference(forward_demodulation,[status(thm)],[f223,f3899]) ).
fof(f3901,plain,
! [X0,X1] : X0 = least_upper_bound(X0,multiply(inverse(least_upper_bound(inverse(X0),X1)),identity)),
inference(forward_demodulation,[status(thm)],[f22,f3900]) ).
fof(f3902,plain,
! [X0,X1] : X0 = least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(forward_demodulation,[status(thm)],[f97,f3901]) ).
fof(f4032,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(paramodulation,[status(thm)],[f139,f3902]) ).
fof(f4283,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(paramodulation,[status(thm)],[f88,f4032]) ).
fof(f4796,plain,
inverse(b) = least_upper_bound(inverse(b),inverse(a)),
inference(paramodulation,[status(thm)],[f33,f4283]) ).
fof(f4797,plain,
inverse(b) = least_upper_bound(inverse(a),inverse(b)),
inference(forward_demodulation,[status(thm)],[f22,f4796]) ).
fof(f4923,plain,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
inference(paramodulation,[status(thm)],[f4797,f28]) ).
fof(f4924,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f4923,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP190-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:46:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 2.95/0.83 % Refutation found
% 2.95/0.83 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 2.95/0.83 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 2.95/0.85 % Elapsed time: 0.498285 seconds
% 2.95/0.85 % CPU time: 3.112119 seconds
% 2.95/0.85 % Memory used: 56.692 MB
%------------------------------------------------------------------------------