TSTP Solution File: GRP169-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP169-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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 0.15s 0.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 34 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 : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 50 (; 50 !; 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(f5,axiom,
! [X,Y] : least_upper_bound(X,Y) = least_upper_bound(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(inverse(a),inverse(b)) = inverse(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
least_upper_bound(a,b) != 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(f22,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
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(inverse(a),inverse(b)) = inverse(b),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f34,plain,
least_upper_bound(a,b) != a,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f50,plain,
! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X2),multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f22,f29]) ).
fof(f51,plain,
! [X0,X1,X2] : multiply(X0,least_upper_bound(X1,X2)) = multiply(X0,least_upper_bound(X2,X1)),
inference(forward_demodulation,[status(thm)],[f29,f50]) ).
fof(f1145,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(multiply(X0,X1),identity),
inference(paramodulation,[status(thm)],[f19,f31]) ).
fof(f1146,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f22,f1145]) ).
fof(f1148,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(paramodulation,[status(thm)],[f19,f29]) ).
fof(f1149,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(forward_demodulation,[status(thm)],[f22,f1148]) ).
fof(f1382,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f19,f20]) ).
fof(f1383,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f18,f1382]) ).
fof(f1436,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f1383,f1383]) ).
fof(f1437,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f19,f1383]) ).
fof(f1438,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f1436,f1437]) ).
fof(f3221,plain,
multiply(inverse(b),b) = least_upper_bound(identity,multiply(inverse(a),b)),
inference(paramodulation,[status(thm)],[f33,f1146]) ).
fof(f3222,plain,
identity = least_upper_bound(identity,multiply(inverse(a),b)),
inference(forward_demodulation,[status(thm)],[f19,f3221]) ).
fof(f3429,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(paramodulation,[status(thm)],[f1383,f1436]) ).
fof(f4921,plain,
multiply(inverse(a),least_upper_bound(b,a)) = identity,
inference(paramodulation,[status(thm)],[f3222,f1149]) ).
fof(f4922,plain,
multiply(inverse(a),least_upper_bound(a,b)) = identity,
inference(forward_demodulation,[status(thm)],[f51,f4921]) ).
fof(f7131,plain,
multiply(a,identity) = least_upper_bound(a,b),
inference(paramodulation,[status(thm)],[f4922,f3429]) ).
fof(f7132,plain,
a = least_upper_bound(a,b),
inference(forward_demodulation,[status(thm)],[f1438,f7131]) ).
fof(f7133,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f7132,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GRP169-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n031.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 11:51:52 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.31 % Drodi V3.5.1
% 0.15/0.51 % Refutation found
% 0.15/0.51 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.53 % Elapsed time: 0.217700 seconds
% 0.15/0.53 % CPU time: 1.186389 seconds
% 0.15/0.53 % Memory used: 19.904 MB
%------------------------------------------------------------------------------