TSTP Solution File: GRP191-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP191-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n032.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 4.30s 0.89s
% Output : CNFRefutation 4.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 44 unt; 0 def)
% Number of atoms : 44 ( 43 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 : 64 (; 64 !; 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(f10,axiom,
! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
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(f15,axiom,
! [Y,Z,X] : multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
greatest_lower_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
file('/export/starexec/sandbox/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(f30,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(f32,plain,
! [X0,X1,X2] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f33,plain,
greatest_lower_bound(a,b) = b,
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(f317,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),X0) = greatest_lower_bound(identity,multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f19,f32]) ).
fof(f324,plain,
least_upper_bound(a,b) = a,
inference(paramodulation,[status(thm)],[f33,f27]) ).
fof(f347,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f412,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f19,f20]) ).
fof(f413,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f18,f412]) ).
fof(f1241,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f19,f413]) ).
fof(f1281,plain,
! [X0] : identity = multiply(inverse(inverse(inverse(X0))),X0),
inference(paramodulation,[status(thm)],[f1241,f413]) ).
fof(f1298,plain,
! [X0] : X0 = multiply(inverse(inverse(inverse(inverse(X0)))),identity),
inference(paramodulation,[status(thm)],[f1281,f413]) ).
fof(f1299,plain,
! [X0] : X0 = inverse(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f1241,f1298]) ).
fof(f1318,plain,
! [X0] : X0 = multiply(X0,identity),
inference(backward_demodulation,[status(thm)],[f1299,f1241]) ).
fof(f1321,plain,
! [X0] : multiply(X0,inverse(X0)) = identity,
inference(paramodulation,[status(thm)],[f1299,f19]) ).
fof(f1341,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,inverse(X0))) = greatest_lower_bound(multiply(X0,X1),identity),
inference(paramodulation,[status(thm)],[f1321,f30]) ).
fof(f1342,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,inverse(X0))) = greatest_lower_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f21,f1341]) ).
fof(f1598,plain,
! [X0,X1] : multiply(inverse(X0),X0) = greatest_lower_bound(identity,multiply(least_upper_bound(X1,inverse(X0)),X0)),
inference(paramodulation,[status(thm)],[f347,f317]) ).
fof(f1599,plain,
! [X0,X1] : identity = greatest_lower_bound(identity,multiply(least_upper_bound(X0,inverse(X1)),X1)),
inference(forward_demodulation,[status(thm)],[f19,f1598]) ).
fof(f1666,plain,
! [X0,X1] : identity = greatest_lower_bound(identity,multiply(least_upper_bound(X0,X1),inverse(X1))),
inference(paramodulation,[status(thm)],[f1299,f1599]) ).
fof(f1728,plain,
identity = greatest_lower_bound(identity,multiply(a,inverse(b))),
inference(paramodulation,[status(thm)],[f324,f1666]) ).
fof(f2134,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(X1)) = multiply(inverse(X1),greatest_lower_bound(identity,multiply(X1,X0))),
inference(paramodulation,[status(thm)],[f1342,f413]) ).
fof(f4388,plain,
greatest_lower_bound(inverse(b),inverse(a)) = multiply(inverse(a),identity),
inference(paramodulation,[status(thm)],[f1728,f2134]) ).
fof(f4389,plain,
greatest_lower_bound(inverse(a),inverse(b)) = multiply(inverse(a),identity),
inference(forward_demodulation,[status(thm)],[f21,f4388]) ).
fof(f4390,plain,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
inference(forward_demodulation,[status(thm)],[f1318,f4389]) ).
fof(f4391,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f4390,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : GRP191-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 30 11:32:31 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % Drodi V3.5.1
% 4.30/0.89 % Refutation found
% 4.30/0.89 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 4.30/0.89 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.67/0.93 % Elapsed time: 0.613921 seconds
% 4.67/0.93 % CPU time: 4.742216 seconds
% 4.67/0.93 % Memory used: 90.856 MB
%------------------------------------------------------------------------------