TSTP Solution File: GRP142-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP142-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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:31 EDT 2024
% Result : Unsatisfiable 0.18s 0.37s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X,Y] : least_upper_bound(X,Y) = least_upper_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(f16,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),a) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f21,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f26,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f32,plain,
least_upper_bound(greatest_lower_bound(a,b),a) != a,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f33,plain,
least_upper_bound(a,greatest_lower_bound(a,b)) != a,
inference(backward_demodulation,[status(thm)],[f21,f32]) ).
fof(f34,plain,
$false,
inference(resolution,[status(thm)],[f26,f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP142-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.35 % Computer : n017.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon Apr 29 23:54:33 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.18/0.36 % Drodi V3.6.0
% 0.18/0.37 % Refutation found
% 0.18/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.38 % Elapsed time: 0.015267 seconds
% 0.18/0.38 % CPU time: 0.017383 seconds
% 0.18/0.38 % Total memory used: 1.749 MB
% 0.18/0.38 % Net memory used: 1.647 MB
%------------------------------------------------------------------------------