TSTP Solution File: GRP138-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP138-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:30 EDT 2024
% Result : Unsatisfiable 6.62s 1.15s
% Output : CNFRefutation 6.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f6,axiom,
! [X,Y,Z] : greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
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(f16,hypothesis,
least_upper_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
least_upper_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f23,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f24,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f29,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f34,plain,
least_upper_bound(a,c) = a,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f35,plain,
least_upper_bound(b,c) = b,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f36,plain,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f37,plain,
least_upper_bound(c,b) = b,
inference(forward_demodulation,[status(thm)],[f23,f35]) ).
fof(f38,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
inference(forward_demodulation,[status(thm)],[f23,f36]) ).
fof(f46,plain,
greatest_lower_bound(c,b) = c,
inference(paramodulation,[status(thm)],[f37,f29]) ).
fof(f52,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f54,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f65,plain,
greatest_lower_bound(c,a) = c,
inference(paramodulation,[status(thm)],[f34,f54]) ).
fof(f66,plain,
greatest_lower_bound(a,c) = c,
inference(forward_demodulation,[status(thm)],[f22,f65]) ).
fof(f102,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(c,X0)) = greatest_lower_bound(c,X0),
inference(paramodulation,[status(thm)],[f66,f24]) ).
fof(f106,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X1,X0),X2),
inference(paramodulation,[status(thm)],[f22,f24]) ).
fof(f107,plain,
! [X0,X1,X2] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(forward_demodulation,[status(thm)],[f24,f106]) ).
fof(f1190,plain,
! [X0,X1,X2] : least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X0,greatest_lower_bound(X2,X1))) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f107,f52]) ).
fof(f4913,plain,
! [X0] : least_upper_bound(greatest_lower_bound(a,X0),greatest_lower_bound(c,X0)) = greatest_lower_bound(a,X0),
inference(paramodulation,[status(thm)],[f102,f1190]) ).
fof(f6752,plain,
least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b),
inference(paramodulation,[status(thm)],[f46,f4913]) ).
fof(f6753,plain,
least_upper_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(a,b),
inference(forward_demodulation,[status(thm)],[f23,f6752]) ).
fof(f6754,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f6753,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP138-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29 % Computer : n015.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue Apr 30 00:46:02 EDT 2024
% 0.08/0.30 % CPUTime :
% 0.08/0.30 % Drodi V3.6.0
% 6.62/1.15 % Refutation found
% 6.62/1.15 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 6.62/1.15 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 6.62/1.19 % Elapsed time: 0.881862 seconds
% 6.62/1.19 % CPU time: 6.879831 seconds
% 6.62/1.19 % Total memory used: 102.420 MB
% 6.62/1.19 % Net memory used: 101.238 MB
%------------------------------------------------------------------------------