TSTP Solution File: GRP147-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP147-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:32 EDT 2024
% Result : Unsatisfiable 6.11s 1.14s
% Output : CNFRefutation 6.30s
% 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(f7,axiom,
! [X,Y,Z] : least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_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,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_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(f25,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
inference(cnf_transformation,[status(esa)],[f7]) ).
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,
greatest_lower_bound(a,c) = a,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f35,plain,
greatest_lower_bound(b,c) = b,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f36,plain,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f37,plain,
greatest_lower_bound(c,b) = b,
inference(forward_demodulation,[status(thm)],[f22,f35]) ).
fof(f38,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(forward_demodulation,[status(thm)],[f22,f36]) ).
fof(f46,plain,
least_upper_bound(c,b) = c,
inference(paramodulation,[status(thm)],[f37,f28]) ).
fof(f52,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f54,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f22,f28]) ).
fof(f65,plain,
least_upper_bound(c,a) = c,
inference(paramodulation,[status(thm)],[f34,f54]) ).
fof(f66,plain,
least_upper_bound(a,c) = c,
inference(forward_demodulation,[status(thm)],[f23,f65]) ).
fof(f197,plain,
! [X0] : least_upper_bound(a,least_upper_bound(c,X0)) = least_upper_bound(c,X0),
inference(paramodulation,[status(thm)],[f66,f25]) ).
fof(f207,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X1,X0),X2),
inference(paramodulation,[status(thm)],[f23,f25]) ).
fof(f208,plain,
! [X0,X1,X2] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(forward_demodulation,[status(thm)],[f25,f207]) ).
fof(f1409,plain,
! [X0,X1,X2] : greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X0,least_upper_bound(X2,X1))) = least_upper_bound(X0,X1),
inference(paramodulation,[status(thm)],[f208,f52]) ).
fof(f5112,plain,
! [X0] : greatest_lower_bound(least_upper_bound(a,X0),least_upper_bound(c,X0)) = least_upper_bound(a,X0),
inference(paramodulation,[status(thm)],[f197,f1409]) ).
fof(f6907,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b),
inference(paramodulation,[status(thm)],[f46,f5112]) ).
fof(f6908,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(forward_demodulation,[status(thm)],[f22,f6907]) ).
fof(f6909,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f6908,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP147-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.34 % Computer : n009.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Tue Apr 30 00:17:56 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.11/0.35 % Drodi V3.6.0
% 6.11/1.14 % Refutation found
% 6.11/1.14 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 6.11/1.14 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 6.30/1.17 % Elapsed time: 0.820530 seconds
% 6.30/1.17 % CPU time: 6.381364 seconds
% 6.30/1.17 % Total memory used: 102.971 MB
% 6.30/1.17 % Net memory used: 101.870 MB
%------------------------------------------------------------------------------