TSTP Solution File: GRP169-2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP169-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:36 EDT 2024
% Result : Unsatisfiable 4.62s 0.94s
% Output : CNFRefutation 4.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% 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 : 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 : 67 ( 67 !; 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(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(inverse(a),inverse(b)) = inverse(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
greatest_lower_bound(a,b) != b,
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(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(inverse(a),inverse(b)) = inverse(a),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f34,plain,
greatest_lower_bound(a,b) != b,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f50,plain,
! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X2),multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f21,f30]) ).
fof(f51,plain,
! [X0,X1,X2] : multiply(X0,greatest_lower_bound(X1,X2)) = multiply(X0,greatest_lower_bound(X2,X1)),
inference(forward_demodulation,[status(thm)],[f30,f50]) ).
fof(f1125,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(X0,X1)),greatest_lower_bound(X1,X0)) = identity,
inference(paramodulation,[status(thm)],[f51,f19]) ).
fof(f1137,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(f1140,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(paramodulation,[status(thm)],[f19,f30]) ).
fof(f1188,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f1363,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(paramodulation,[status(thm)],[f19,f20]) ).
fof(f1364,plain,
! [X0,X1] : X0 = multiply(inverse(X1),multiply(X1,X0)),
inference(forward_demodulation,[status(thm)],[f18,f1363]) ).
fof(f1399,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f1364,f1364]) ).
fof(f1400,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f19,f1364]) ).
fof(f1401,plain,
! [X0] : X0 = multiply(X0,identity),
inference(forward_demodulation,[status(thm)],[f1399,f1400]) ).
fof(f1905,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = multiply(inverse(inverse(greatest_lower_bound(X1,X0))),identity),
inference(paramodulation,[status(thm)],[f1125,f1364]) ).
fof(f1906,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = inverse(inverse(greatest_lower_bound(X1,X0))),
inference(forward_demodulation,[status(thm)],[f1401,f1905]) ).
fof(f2110,plain,
! [X0,X1] : greatest_lower_bound(least_upper_bound(X0,X1),X1) = inverse(inverse(X1)),
inference(paramodulation,[status(thm)],[f1188,f1906]) ).
fof(f2111,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = inverse(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f21,f2110]) ).
fof(f2112,plain,
! [X0] : X0 = inverse(inverse(X0)),
inference(forward_demodulation,[status(thm)],[f1188,f2111]) ).
fof(f2162,plain,
! [X0,X1] : X0 = multiply(X1,multiply(inverse(X1),X0)),
inference(paramodulation,[status(thm)],[f2112,f1364]) ).
fof(f2909,plain,
multiply(inverse(a),a) = greatest_lower_bound(identity,multiply(inverse(b),a)),
inference(paramodulation,[status(thm)],[f33,f1137]) ).
fof(f2910,plain,
identity = greatest_lower_bound(identity,multiply(inverse(b),a)),
inference(forward_demodulation,[status(thm)],[f19,f2909]) ).
fof(f5374,plain,
identity = multiply(inverse(b),greatest_lower_bound(b,a)),
inference(paramodulation,[status(thm)],[f1140,f2910]) ).
fof(f5375,plain,
identity = multiply(inverse(b),greatest_lower_bound(a,b)),
inference(forward_demodulation,[status(thm)],[f51,f5374]) ).
fof(f6524,plain,
greatest_lower_bound(a,b) = multiply(b,identity),
inference(paramodulation,[status(thm)],[f5375,f2162]) ).
fof(f6525,plain,
greatest_lower_bound(a,b) = b,
inference(forward_demodulation,[status(thm)],[f1401,f6524]) ).
fof(f6526,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f6525,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP169-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 30 00:17:41 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.32 % Drodi V3.6.0
% 4.62/0.94 % Refutation found
% 4.62/0.94 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 4.62/0.94 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.92/0.98 % Elapsed time: 0.648870 seconds
% 4.92/0.98 % CPU time: 5.036645 seconds
% 4.92/0.98 % Total memory used: 80.463 MB
% 4.92/0.98 % Net memory used: 79.418 MB
%------------------------------------------------------------------------------