TSTP Solution File: GRP148-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n002.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:44 EDT 2023
% Result : Unsatisfiable 0.21s 0.45s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 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 : 3 ( 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 : 24 (; 24 !; 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(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) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
least_upper_bound(b,c) = c,
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(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) = c,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f35,plain,
least_upper_bound(b,c) = c,
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,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(paramodulation,[status(thm)],[f22,f36]) ).
fof(f43,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f48,plain,
least_upper_bound(c,b) = c,
inference(forward_demodulation,[status(thm)],[f23,f35]) ).
fof(f103,plain,
! [X0] : least_upper_bound(c,least_upper_bound(b,X0)) = least_upper_bound(c,X0),
inference(paramodulation,[status(thm)],[f48,f25]) ).
fof(f355,plain,
! [X0] : greatest_lower_bound(least_upper_bound(b,X0),least_upper_bound(c,X0)) = least_upper_bound(b,X0),
inference(paramodulation,[status(thm)],[f103,f43]) ).
fof(f356,plain,
! [X0] : greatest_lower_bound(least_upper_bound(c,X0),least_upper_bound(b,X0)) = least_upper_bound(b,X0),
inference(forward_demodulation,[status(thm)],[f22,f355]) ).
fof(f1162,plain,
! [X0] : greatest_lower_bound(least_upper_bound(X0,c),least_upper_bound(b,X0)) = least_upper_bound(b,X0),
inference(paramodulation,[status(thm)],[f23,f356]) ).
fof(f1451,plain,
greatest_lower_bound(c,least_upper_bound(b,a)) = least_upper_bound(b,a),
inference(paramodulation,[status(thm)],[f34,f1162]) ).
fof(f1452,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(b,a),
inference(forward_demodulation,[status(thm)],[f23,f1451]) ).
fof(f1453,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(forward_demodulation,[status(thm)],[f23,f1452]) ).
fof(f1454,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1453,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue May 30 11:41:58 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % Drodi V3.5.1
% 0.21/0.45 % Refutation found
% 0.21/0.45 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.21/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.45 % Elapsed time: 0.097881 seconds
% 0.21/0.45 % CPU time: 0.668913 seconds
% 0.21/0.45 % Memory used: 10.863 MB
%------------------------------------------------------------------------------