TSTP Solution File: GRP148-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : 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 7.30s 1.21s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% 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 : 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 : 31 ( 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X,Y] : greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] : least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] : greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
least_upper_bound(a,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,hypothesis,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/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,
least_upper_bound(c,b) = c,
inference(forward_demodulation,[status(thm)],[f23,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(f54,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f23,f29]) ).
fof(f197,plain,
! [X0] : least_upper_bound(a,least_upper_bound(c,X0)) = least_upper_bound(c,X0),
inference(paramodulation,[status(thm)],[f34,f25]) ).
fof(f206,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(f207,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,f206]) ).
fof(f1413,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)],[f207,f54]) ).
fof(f5117,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,f1413]) ).
fof(f6911,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b),
inference(paramodulation,[status(thm)],[f37,f5117]) ).
fof(f6912,plain,
greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(forward_demodulation,[status(thm)],[f22,f6911]) ).
fof(f6913,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f6912,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP148-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26 % Computer : n009.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Tue Apr 30 00:10:25 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.06/0.26 % Drodi V3.6.0
% 7.30/1.21 % Refutation found
% 7.30/1.21 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 7.30/1.21 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 7.30/1.22 % Elapsed time: 0.947341 seconds
% 7.30/1.22 % CPU time: 7.434593 seconds
% 7.30/1.22 % Total memory used: 108.433 MB
% 7.30/1.22 % Net memory used: 107.099 MB
%------------------------------------------------------------------------------