%------------------------------------------------------------------------------
% File     : Refute---2015
% Problem  : NUN021^1 : TPTP v6.4.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : isabelle tptp_refute %d %s

% Computer : n023.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 16091.75MB
% OS       : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Thu Apr 14 02:20:50 EDT 2016

% Result   : GaveUp 12.60s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUN021^1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04  % Command  : isabelle tptp_refute %d %s
% 0.03/0.23  % Computer : n023.star.cs.uiowa.edu
% 0.03/0.23  % Model    : x86_64 x86_64
% 0.03/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23  % Memory   : 16091.75MB
% 0.03/0.23  % OS       : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Tue Apr  5 15:02:54 CDT 2016
% 0.03/0.23  % CPUTime  : 
% 6.25/5.85  > val it = (): unit
% 6.45/6.05  Trying to find a model that refutes: True
% 6.56/6.14  Unfolded term: [| bnd_mult = (%M N X. M (N X)); bnd_plus = (%M N X Y. M X (N X Y));
% 6.56/6.14     bnd_succ = (%N X Y. X (N X Y));
% 6.56/6.14     bnd_ten = (%X Y. X (X (X (X (X (X (X (X (X (X Y))))))))));
% 6.56/6.14     bnd_nine = (%X Y. X (X (X (X (X (X (X (X (X Y)))))))));
% 6.56/6.14     bnd_eight = (%X Y. X (X (X (X (X (X (X (X Y))))))));
% 6.56/6.14     bnd_seven = (%X Y. X (X (X (X (X (X (X Y)))))));
% 6.56/6.14     bnd_six = (%X Y. X (X (X (X (X (X Y))))));
% 6.56/6.14     bnd_five = (%X Y. X (X (X (X (X Y)))));
% 6.56/6.14     bnd_four = (%X Y. X (X (X (X Y)))); bnd_three = (%X Y. X (X (X Y)));
% 6.56/6.14     bnd_two = (%X Y. X (X Y)); bnd_one = (%X. X); bnd_zero = (%X Y. Y) |]
% 6.56/6.14  ==> True
% 6.56/6.14  Adding axioms...
% 6.56/6.14  Typedef.type_definition_def
% 9.06/8.65   ...done.
% 9.06/8.65  Ground types: ?'b, TPTP_Interpret.ind
% 9.06/8.65  Translating term (sizes: 1, 1) ...
% 9.56/9.13  Invoking SAT solver...
% 9.56/9.13  No model exists.
% 9.56/9.13  Translating term (sizes: 2, 1) ...
% 10.76/10.34  Invoking SAT solver...
% 10.76/10.34  No model exists.
% 10.76/10.34  Translating term (sizes: 1, 2) ...
% 12.60/12.13  Search terminated, number of Boolean variables (100000 allowed) exceeded.
% 12.60/12.13  % SZS status Unknown
%------------------------------------------------------------------------------