TSTP Solution File: GRP162-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP162-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n020.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:34 EDT 2024
% Result : Unsatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% 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 : 2 ( 2 ~; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f16,hypothesis,
least_upper_bound(a,b) = b,
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,
least_upper_bound(a,c) != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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(f34,plain,
least_upper_bound(a,b) = b,
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f35,plain,
least_upper_bound(b,c) = c,
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f36,plain,
least_upper_bound(a,c) != c,
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f184,plain,
! [X0] : least_upper_bound(a,least_upper_bound(b,X0)) = least_upper_bound(b,X0),
inference(paramodulation,[status(thm)],[f34,f25]) ).
fof(f317,plain,
least_upper_bound(a,c) = least_upper_bound(b,c),
inference(paramodulation,[status(thm)],[f35,f184]) ).
fof(f318,plain,
least_upper_bound(a,c) = c,
inference(forward_demodulation,[status(thm)],[f35,f317]) ).
fof(f319,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f318,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP162-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 00:13:47 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Drodi V3.6.0
% 0.14/0.38 % Refutation found
% 0.14/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.39 % Elapsed time: 0.027636 seconds
% 0.14/0.39 % CPU time: 0.120098 seconds
% 0.14/0.39 % Total memory used: 5.935 MB
% 0.14/0.39 % Net memory used: 5.853 MB
%------------------------------------------------------------------------------