TSTP Solution File: GRP143-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP143-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n001.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:43 EDT 2023
% Result : Unsatisfiable 0.14s 0.54s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 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(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(f9,axiom,
! [X] : greatest_lower_bound(X,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,b),a) != greatest_lower_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f22,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(f25,plain,
! [X0] : greatest_lower_bound(X0,X0) = X0,
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f32,plain,
greatest_lower_bound(greatest_lower_bound(a,b),a) != greatest_lower_bound(a,b),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f33,plain,
greatest_lower_bound(a,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
inference(paramodulation,[status(thm)],[f20,f32]) ).
fof(f47,plain,
! [X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X0,X1)) = greatest_lower_bound(X0,X1),
inference(paramodulation,[status(thm)],[f25,f22]) ).
fof(f51,plain,
greatest_lower_bound(a,b) != greatest_lower_bound(a,b),
inference(backward_demodulation,[status(thm)],[f47,f33]) ).
fof(f52,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP143-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n001.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 11:56:15 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.14/0.32 % Drodi V3.5.1
% 0.14/0.54 % Refutation found
% 0.14/0.54 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.54 % Elapsed time: 0.009647 seconds
% 0.14/0.54 % CPU time: 0.012437 seconds
% 0.14/0.54 % Memory used: 243.227 KB
%------------------------------------------------------------------------------