TSTP Solution File: GRP192-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP192-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n028.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:42 EDT 2024
% Result : Unsatisfiable 0.15s 0.33s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 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 : 4 ( 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 : 49 ( 49 !; 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(f10,axiom,
! [X,Y] : least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
! [X] : least_upper_bound(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
multiply(a,b) != multiply(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(f21,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f27,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
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(f33,plain,
! [X0] : least_upper_bound(identity,X0) = X0,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f34,plain,
multiply(a,b) != multiply(b,a),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f39,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(paramodulation,[status(thm)],[f19,f20]) ).
fof(f40,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[status(thm)],[f18,f39]) ).
fof(f41,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(paramodulation,[status(thm)],[f40,f40]) ).
fof(f42,plain,
! [X0] : X0 = multiply(inverse(inverse(X0)),identity),
inference(paramodulation,[status(thm)],[f19,f40]) ).
fof(f71,plain,
! [X0] : X0 = multiply(X0,identity),
inference(backward_demodulation,[status(thm)],[f41,f42]) ).
fof(f123,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(paramodulation,[status(thm)],[f41,f71]) ).
fof(f135,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[status(thm)],[f71,f123]) ).
fof(f184,plain,
! [X0] : identity = greatest_lower_bound(identity,X0),
inference(paramodulation,[status(thm)],[f33,f27]) ).
fof(f254,plain,
! [X0] : identity = greatest_lower_bound(X0,identity),
inference(paramodulation,[status(thm)],[f21,f184]) ).
fof(f344,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(paramodulation,[status(thm)],[f71,f30]) ).
fof(f366,plain,
! [X0,X1] : multiply(X0,identity) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f184,f344]) ).
fof(f367,plain,
! [X0,X1] : X0 = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[status(thm)],[f71,f366]) ).
fof(f384,plain,
! [X0] : inverse(X0) = greatest_lower_bound(inverse(X0),identity),
inference(paramodulation,[status(thm)],[f19,f367]) ).
fof(f393,plain,
! [X0] : inverse(X0) = identity,
inference(forward_demodulation,[status(thm)],[f254,f384]) ).
fof(f395,plain,
! [X0] : identity = X0,
inference(backward_demodulation,[status(thm)],[f393,f135]) ).
fof(f401,plain,
! [X0,X1] : X0 = X1,
inference(paramodulation,[status(thm)],[f395,f395]) ).
fof(f402,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f34,f401]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP192-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.02/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 00:50:29 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.6.0
% 0.15/0.33 % Refutation found
% 0.15/0.33 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.34 % Elapsed time: 0.017753 seconds
% 0.15/0.34 % CPU time: 0.047296 seconds
% 0.15/0.34 % Total memory used: 3.814 MB
% 0.15/0.34 % Net memory used: 3.766 MB
%------------------------------------------------------------------------------