TSTP Solution File: PUZ035-2 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : PUZ035-2 : TPTP v5.0.0. Released v2.0.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art09.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Nov 28 04:02:08 EST 2010

% Result   : Unsatisfiable 3.40s
% Output   : Refutation 3.40s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP23909/PUZ/PUZ035-2+noeq.car t=300 xo=off uct=32000
% CARINE version 0.734 (Dec 2003)
% Initializing tables ... done.
% Parsing ................ done.
% Calculating time slices ... done.
% Building Lookup Tables ... done.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 6] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 43] [nf = 2] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 170] [nf = 4] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 574] [nf = 9] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 1712] [nf = 52] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 4897] [nf = 118] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 13944] [nf = 298] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 38867] [nf = 1098] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 106873] [nf = 2408] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 289186] [nf = 7358] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% 	t = 1 secs [nr = 791937] [nf = 20545] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~response_1(x0) | ~isa_2(other_0(),x2) | ~isa_2(asked_0(),x1)
% B4: ~isa_2(x0,knight_0()) | tell_the_truth_1(x0)
% B11: ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0())
% Unit Clauses:
% --------------
% U0: < d0 v0 dv0 f0 c1 t1 td1 b > person_1(asked_0())
% U1: < d0 v0 dv0 f0 c1 t1 td1 b > person_1(other_0())
% U2: < d12 v0 dv0 f0 c2 t2 td1 > ~isa_2(asked_0(),knight_0())
% U3: < d12 v0 dv0 f0 c1 t1 td1 > ~tell_the_truth_1(asked_0())
% U4: < d12 v0 dv0 f0 c1 t1 td1 > lies_1(asked_0())
% U5: < d12 v0 dv0 f0 c2 t2 td1 > isa_2(asked_0(),knave_0())
% U6: < d12 v1 dv1 f0 c1 t2 td1 > ~isa_2(other_0(),x0)
% U9: < d12 v0 dv0 f0 c1 t1 td1 > response_1(yes_0())
% U13: < d12 v0 dv0 f0 c2 t2 td1 > isa_2(other_0(),knave_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% person_1(asked_0()) ....... U0
% Derivation of unit clause U1:
% person_1(other_0()) ....... U1
% Derivation of unit clause U2:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~response_1(x0) | ~isa_2(other_0(),x2) | ~isa_2(asked_0(),x1) ....... B0
%    ~isa_2(asked_0(), knight_0()) | ~isa_2(other_0(), x0) | ~isa_2(asked_0(), x1) ....... R3 [R2:L1, B0:L0]
%     ~isa_2(other_0(), x0) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%      ~isa_2(asked_0(), knight_0()) | ~person_1(other_0()) | isa_2(other_0(), knave_0()) ....... R5 [R4:L0, B12:L1]
%      person_1(other_0()) ....... U1
%       ~isa_2(asked_0(), knight_0()) | isa_2(other_0(), knave_0()) ....... R6 [R5:L1, U1:L0]
%       ~response_1(x0) | ~isa_2(other_0(),x2) | ~isa_2(asked_0(),x1) ....... B0
%        ~isa_2(asked_0(), knight_0()) | ~response_1(x0) | ~isa_2(asked_0(), x1) ....... R7 [R6:L1, B0:L1]
%         ~response_1(x0) | ~isa_2(asked_0(), knight_0()) ....... R8 [R7:L0, R7:L2]
%         ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%          ~isa_2(asked_0(), knight_0()) | ~tell_the_truth_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R9 [R8:L0, B11:L2]
%           ~tell_the_truth_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R10 [R9:L0, R9:L2]
%           ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
%            ~isa_2(asked_0(), knight_0()) | ~isa_2(asked_0(), knight_0()) ....... R11 [R10:L0, B4:L1]
%             ~isa_2(asked_0(), knight_0()) ....... R12 [R11:L0, R11:L1]
% Derivation of unit clause U3:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%    ~isa_2(asked_0(), knight_0()) | ~lies_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R3 [R2:L1, B9:L1]
%     ~lies_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~isa_2(x0,knave_0()) | lies_1(x0) ....... B5
%      ~isa_2(asked_0(), knight_0()) | ~isa_2(asked_0(), knave_0()) ....... R5 [R4:L0, B5:L1]
%      ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%       ~isa_2(asked_0(), knave_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R6 [R5:L0, B12:L1]
%       person_1(asked_0()) ....... U0
%        ~isa_2(asked_0(), knave_0()) | isa_2(asked_0(), knave_0()) ....... R7 [R6:L1, U0:L0]
%        ~isa_2(x0,knave_0()) | lies_1(x0) ....... B5
%         ~isa_2(asked_0(), knave_0()) | lies_1(asked_0()) ....... R8 [R7:L1, B5:L0]
%         ~lies_1(x0) | ~tell_the_truth_1(x0) ....... B3
%          ~isa_2(asked_0(), knave_0()) | ~tell_the_truth_1(asked_0()) ....... R9 [R8:L1, B3:L0]
%          ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%           ~tell_the_truth_1(asked_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knight_0()) ....... R10 [R9:L0, B12:L2]
%           person_1(asked_0()) ....... U0
%            ~tell_the_truth_1(asked_0()) | isa_2(asked_0(), knight_0()) ....... R11 [R10:L1, U0:L0]
%            ~isa_2(asked_0(),knight_0()) ....... U2
%             ~tell_the_truth_1(asked_0()) ....... R12 [R11:L1, U2:L0]
% Derivation of unit clause U4:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%    ~isa_2(asked_0(), knight_0()) | ~lies_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R3 [R2:L1, B9:L1]
%     ~lies_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~isa_2(x0,knave_0()) | lies_1(x0) ....... B5
%      ~isa_2(asked_0(), knight_0()) | ~isa_2(asked_0(), knave_0()) ....... R5 [R4:L0, B5:L1]
%      ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%       ~isa_2(asked_0(), knave_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R6 [R5:L0, B12:L1]
%       person_1(asked_0()) ....... U0
%        ~isa_2(asked_0(), knave_0()) | isa_2(asked_0(), knave_0()) ....... R7 [R6:L1, U0:L0]
%        ~isa_2(x0,knave_0()) | lies_1(x0) ....... B5
%         ~isa_2(asked_0(), knave_0()) | lies_1(asked_0()) ....... R8 [R7:L1, B5:L0]
%         ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%          lies_1(asked_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knight_0()) ....... R9 [R8:L0, B12:L2]
%          person_1(asked_0()) ....... U0
%           lies_1(asked_0()) | isa_2(asked_0(), knight_0()) ....... R10 [R9:L1, U0:L0]
%           ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
%            lies_1(asked_0()) | tell_the_truth_1(asked_0()) ....... R11 [R10:L1, B4:L0]
%            ~tell_the_truth_1(asked_0()) ....... U3
%             lies_1(asked_0()) ....... R12 [R11:L1, U3:L0]
% Derivation of unit clause U5:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%    ~isa_2(asked_0(), knight_0()) | ~lies_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R3 [R2:L1, B9:L1]
%     ~lies_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~isa_2(x0,knave_0()) | lies_1(x0) ....... B5
%      ~isa_2(asked_0(), knight_0()) | ~isa_2(asked_0(), knave_0()) ....... R5 [R4:L0, B5:L1]
%      ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%       ~isa_2(asked_0(), knave_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R6 [R5:L0, B12:L1]
%       person_1(asked_0()) ....... U0
%        ~isa_2(asked_0(), knave_0()) | isa_2(asked_0(), knave_0()) ....... R7 [R6:L1, U0:L0]
%        ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%         isa_2(asked_0(), knave_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knight_0()) ....... R8 [R7:L0, B12:L2]
%         person_1(asked_0()) ....... U0
%          isa_2(asked_0(), knave_0()) | isa_2(asked_0(), knight_0()) ....... R9 [R8:L1, U0:L0]
%          ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
%           isa_2(asked_0(), knave_0()) | tell_the_truth_1(asked_0()) ....... R10 [R9:L1, B4:L0]
%           ~lies_1(x0) | ~tell_the_truth_1(x0) ....... B3
%            isa_2(asked_0(), knave_0()) | ~lies_1(asked_0()) ....... R11 [R10:L1, B3:L1]
%            lies_1(asked_0()) ....... U4
%             isa_2(asked_0(), knave_0()) ....... R12 [R11:L1, U4:L0]
% Derivation of unit clause U6:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%    ~isa_2(asked_0(), knight_0()) | ~lies_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R3 [R2:L1, B9:L1]
%     ~lies_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%      ~lies_1(asked_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R5 [R4:L1, B12:L1]
%      lies_1(asked_0()) ....... U4
%       ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R6 [R5:L0, U4:L0]
%       ~response_1(x0) | ~isa_2(other_0(),x2) | ~isa_2(asked_0(),x1) ....... B0
%        ~person_1(asked_0()) | ~response_1(x0) | ~isa_2(other_0(), x1) ....... R7 [R6:L1, B0:L2]
%        person_1(asked_0()) ....... U0
%         ~response_1(x0) | ~isa_2(other_0(), x1) ....... R8 [R7:L0, U0:L0]
%         response_1(yes_0()) | response_1(no_0()) ....... B7
%          ~isa_2(other_0(), x0) | response_1(no_0()) ....... R9 [R8:L0, B7:L0]
%          ~response_1(x0) | ~isa_2(other_0(),x2) | ~isa_2(asked_0(),x1) ....... B0
%           ~isa_2(other_0(), x0) | ~isa_2(other_0(), x1) | ~isa_2(asked_0(), x2) ....... R10 [R9:L1, B0:L0]
%            ~isa_2(other_0(), x0) | ~isa_2(asked_0(), x1) ....... R11 [R10:L0, R10:L1]
%            isa_2(asked_0(),knave_0()) ....... U5
%             ~isa_2(other_0(), x0) ....... R12 [R11:L1, U5:L0]
% Derivation of unit clause U9:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%    ~isa_2(asked_0(), knight_0()) | ~lies_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R3 [R2:L1, B9:L1]
%     ~lies_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%      ~lies_1(asked_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R5 [R4:L1, B12:L1]
%      lies_1(asked_0()) ....... U4
%       ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R6 [R5:L0, U4:L0]
%       ~response_1(x0) | ~isa_2(other_0(),x2) | ~isa_2(asked_0(),x1) ....... B0
%        ~person_1(asked_0()) | ~response_1(x0) | ~isa_2(other_0(), x1) ....... R7 [R6:L1, B0:L2]
%        person_1(asked_0()) ....... U0
%         ~response_1(x0) | ~isa_2(other_0(), x1) ....... R8 [R7:L0, U0:L0]
%         response_1(yes_0()) | response_1(no_0()) ....... B7
%          ~isa_2(other_0(), x0) | response_1(yes_0()) ....... R9 [R8:L0, B7:L1]
%          ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%           response_1(yes_0()) | ~person_1(other_0()) | isa_2(other_0(), knave_0()) ....... R10 [R9:L0, B12:L1]
%           person_1(other_0()) ....... U1
%            response_1(yes_0()) | isa_2(other_0(), knave_0()) ....... R11 [R10:L1, U1:L0]
%            ~isa_2(other_0(),x0) ....... U6
%             response_1(yes_0()) ....... R12 [R11:L1, U6:L0]
% Derivation of unit clause U13:
% ~isa_2(x0,knight_0()) | tell_the_truth_1(x0) ....... B4
% ~tell_the_truth_1(asked_0()) | ~isa_2(x0,knight_0()) | response_1(yes_0()) ....... B11
%  ~isa_2(asked_0(), knight_0()) | ~isa_2(x0, knight_0()) | response_1(yes_0()) ....... R1 [B4:L1, B11:L0]
%   ~isa_2(asked_0(), knight_0()) | response_1(yes_0()) ....... R2 [R1:L0, R1:L1]
%   ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%    ~isa_2(asked_0(), knight_0()) | ~lies_1(asked_0()) | ~isa_2(x0, knight_0()) ....... R3 [R2:L1, B9:L1]
%     ~lies_1(asked_0()) | ~isa_2(asked_0(), knight_0()) ....... R4 [R3:L0, R3:L2]
%     ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%      ~lies_1(asked_0()) | ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R5 [R4:L1, B12:L1]
%      lies_1(asked_0()) ....... U4
%       ~person_1(asked_0()) | isa_2(asked_0(), knave_0()) ....... R6 [R5:L0, U4:L0]
%       ~isa_2(x0,knave_0()) | lies_1(x0) ....... B5
%        ~person_1(asked_0()) | lies_1(asked_0()) ....... R7 [R6:L1, B5:L0]
%        ~lies_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0,knight_0()) ....... B9
%         ~person_1(asked_0()) | ~response_1(yes_0()) | ~isa_2(x0, knight_0()) ....... R8 [R7:L1, B9:L0]
%         person_1(asked_0()) ....... U0
%          ~response_1(yes_0()) | ~isa_2(x0, knight_0()) ....... R9 [R8:L0, U0:L0]
%          ~person_1(x0) | isa_2(x0,knight_0()) | isa_2(x0,knave_0()) ....... B12
%           ~response_1(yes_0()) | ~person_1(x0) | isa_2(x0, knave_0()) ....... R10 [R9:L1, B12:L1]
%           response_1(yes_0()) ....... U9
%            ~person_1(x0) | isa_2(x0, knave_0()) ....... R11 [R10:L0, U9:L0]
%            person_1(other_0()) ....... U1
%             isa_2(other_0(), knave_0()) ....... R12 [R11:L0, U1:L0]
% Derivation of the empty clause:
% isa_2(other_0(),knave_0()) ....... U13
% ~isa_2(other_0(),x0) ....... U6
%  [] ....... R1 [U13:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1643977
% 	resolvents: 1608047	factors: 35930
% Number of unit clauses generated: 921
% % unit clauses generated to total clauses generated: 0.06
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2		[12] = 12	
% Total = 14
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 921	[2] = 929762	[3] = 713294	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] lies_1		(+)2	(-)0
% [1] person_1		(+)2	(-)0
% [2] response_1		(+)2	(-)0
% [3] tell_the_truth_1	(+)1	(-)1
% [4] isa_2		(+)2	(-)4
% 			------------------
% 		Total:	(+)9	(-)5
% Total number of unit clauses retained: 14
% Number of clauses skipped because of their length: 2252005
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 909500
% Number of successful unifications: 1644061
% Number of unification failures: 357535
% Number of unit to unit unification failures: 6
% N literal unification failure due to lookup root_id table: 5206705
% N base clause resolution failure due to lookup table: 6460710
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 11
% N unit clauses dropped because they exceeded max values: 591
% N unit clauses dropped because too much nesting: 0
% N unit clauses not constrcuted because table was full: 0
% N unit clauses dropped because UCFA table was full: 0
% Max number of terms in a unit clause: 2
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 14
% Total number of terms of all unit clauses in table: 20
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.70
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 2001596
% ConstructUnitClause() = 603
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 547992
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 3 secs
% CPU time: 3.40 secs
% 
%------------------------------------------------------------------------------