TSTP Solution File: PUZ018-1 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : PUZ018-1 : TPTP v5.0.0. Bugfixed v1.2.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art07.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 03:54:28 EST 2010

% Result   : Unsatisfiable 0.53s
% Output   : Refutation 0.53s
% 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/SystemOnTPTP17270/PUZ/PUZ018-1+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 = 33] [nf = 0] [nu = 12] [ut = 44]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 88] [nf = 2] [nu = 24] [ut = 44]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 151] [nf = 4] [nu = 36] [ut = 44]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 220] [nf = 12] [nu = 48] [ut = 44]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 301] [nf = 32] [nu = 60] [ut = 44]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 382] [nf = 58] [nu = 78] [ut = 44]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 463] [nf = 84] [nu = 96] [ut = 44]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 544] [nf = 110] [nu = 114] [ut = 44]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 625] [nf = 136] [nu = 132] [ut = 44]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 706] [nf = 162] [nu = 150] [ut = 44]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 787] [nf = 188] [nu = 168] [ut = 44]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 868] [nf = 214] [nu = 186] [ut = 44]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 949] [nf = 240] [nu = 204] [ut = 44]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 1030] [nf = 266] [nu = 222] [ut = 44]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 1111] [nf = 292] [nu = 240] [ut = 44]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 1192] [nf = 318] [nu = 258] [ut = 44]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 1273] [nf = 344] [nu = 276] [ut = 44]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 1354] [nf = 370] [nu = 294] [ut = 44]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 1435] [nf = 396] [nu = 312] [ut = 44]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 1516] [nf = 422] [nu = 330] [ut = 44]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 1597] [nf = 448] [nu = 348] [ut = 44]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 1678] [nf = 474] [nu = 366] [ut = 44]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 1759] [nf = 500] [nu = 384] [ut = 44]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 1840] [nf = 526] [nu = 402] [ut = 44]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 1921] [nf = 552] [nu = 420] [ut = 44]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 2002] [nf = 578] [nu = 438] [ut = 44]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 2083] [nf = 604] [nu = 456] [ut = 44]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 2164] [nf = 630] [nu = 474] [ut = 44]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 2245] [nf = 656] [nu = 492] [ut = 44]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 2326] [nf = 682] [nu = 510] [ut = 44]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 2359] [nf = 682] [nu = 522] [ut = 44]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 2414] [nf = 684] [nu = 534] [ut = 44]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 2483] [nf = 686] [nu = 546] [ut = 44]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 2707] [nf = 1107] [nu = 558] [ut = 44]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 24414] [nf = 2063] [nu = 3240] [ut = 57]
% Looking for a proof at depth = 6 ...
% 	t = 1 secs [nr = 108347] [nf = 7457] [nu = 7410] [ut = 59]
% Looking for a proof at depth = 7 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~all_on_1(friday_0())
% B3: consecutive_2(sunday_0(),monday_0())
% B5: consecutive_2(tuesday_0(),wednesday_0())
% B10: ~on_2(a_0(),sunday_0())
% B11: ~on_2(a_0(),tuesday_0())
% B14: ~on_2(b_0(),saturday_0())
% B40: ~all_on_1(x0) | on_2(a_0(),x0)
% B41: ~all_on_1(x0) | on_2(b_0(),x0)
% B45: ~consecutive_2(x2,x3) | ~consecutive_2(x1,x2) | ~consecutive_2(x0,x1) | ~on_2(x4,x2) | ~on_2(x4,x1) | ~on_2(x4,x0)
% B46: on_2(x0,x1) | on_2(x0,x2) | on_2(x3,x1) | on_2(x3,x2) | same_day_2(x1,x2) | same_person_2(x0,x3)
% B47: all_on_1(sunday_0()) | all_on_1(monday_0()) | all_on_1(tuesday_0()) | all_on_1(wednesday_0()) | all_on_1(thursday_0()) | all_on_1(friday_0()) | all_on_1(saturday_0())
% Unit Clauses:
% --------------
% U4: < d0 v0 dv0 f0 c2 t2 td1 b > consecutive_2(monday_0(),tuesday_0())
% U5: < d0 v0 dv0 f0 c2 t2 td1 b > consecutive_2(tuesday_0(),wednesday_0())
% U6: < d0 v0 dv0 f0 c2 t2 td1 b > consecutive_2(wednesday_0(),thursday_0())
% U7: < d0 v0 dv0 f0 c2 t2 td1 b > consecutive_2(thursday_0(),friday_0())
% U11: < d0 v0 dv0 f0 c2 t2 td1 b > ~on_2(a_0(),tuesday_0())
% U12: < d0 v0 dv0 f0 c2 t2 td1 b > ~on_2(a_0(),thursday_0())
% U13: < d0 v0 dv0 f0 c2 t2 td1 b > ~on_2(b_0(),thursday_0())
% U15: < d0 v0 dv0 f0 c2 t2 td1 b > ~on_2(c_0(),sunday_0())
% U17: < d0 v0 dv0 f0 c2 t2 td1 b > ~same_day_2(sunday_0(),tuesday_0())
% U19: < d0 v0 dv0 f0 c2 t2 td1 b > ~same_day_2(sunday_0(),thursday_0())
% U28: < d0 v0 dv0 f0 c2 t2 td1 b > ~same_day_2(tuesday_0(),thursday_0())
% U37: < d0 v0 dv0 f0 c2 t2 td1 b > ~same_person_2(a_0(),b_0())
% U38: < d0 v0 dv0 f0 c2 t2 td1 b > ~same_person_2(a_0(),c_0())
% U40: < d1 v0 dv0 f0 c1 t1 td1 > ~all_on_1(sunday_0())
% U41: < d1 v0 dv0 f0 c1 t1 td1 > ~all_on_1(tuesday_0())
% U43: < d1 v0 dv0 f0 c1 t1 td1 > ~all_on_1(saturday_0())
% U46: < d5 v0 dv0 f0 c2 t2 td1 > on_2(c_0(),tuesday_0())
% U47: < d5 v0 dv0 f0 c2 t2 td1 > on_2(c_0(),thursday_0())
% U48: < d5 v0 dv0 f0 c2 t2 td1 > on_2(b_0(),sunday_0())
% U49: < d5 v0 dv0 f0 c2 t2 td1 > on_2(b_0(),tuesday_0())
% U57: < d6 v0 dv0 f0 c1 t1 td1 > ~all_on_1(monday_0())
% U58: < d6 v0 dv0 f0 c1 t1 td1 > ~all_on_1(wednesday_0())
% U59: < d7 v0 dv0 f0 c2 t2 td1 > on_2(a_0(),thursday_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U4:
% consecutive_2(monday_0(),tuesday_0()) ....... U4
% Derivation of unit clause U5:
% consecutive_2(tuesday_0(),wednesday_0()) ....... U5
% Derivation of unit clause U6:
% consecutive_2(wednesday_0(),thursday_0()) ....... U6
% Derivation of unit clause U7:
% consecutive_2(thursday_0(),friday_0()) ....... U7
% Derivation of unit clause U11:
% ~on_2(a_0(),tuesday_0()) ....... U11
% Derivation of unit clause U12:
% ~on_2(a_0(),thursday_0()) ....... U12
% Derivation of unit clause U13:
% ~on_2(b_0(),thursday_0()) ....... U13
% Derivation of unit clause U15:
% ~on_2(c_0(),sunday_0()) ....... U15
% Derivation of unit clause U17:
% ~same_day_2(sunday_0(),tuesday_0()) ....... U17
% Derivation of unit clause U19:
% ~same_day_2(sunday_0(),thursday_0()) ....... U19
% Derivation of unit clause U28:
% ~same_day_2(tuesday_0(),thursday_0()) ....... U28
% Derivation of unit clause U37:
% ~same_person_2(a_0(),b_0()) ....... U37
% Derivation of unit clause U38:
% ~same_person_2(a_0(),c_0()) ....... U38
% Derivation of unit clause U40:
% ~on_2(a_0(),sunday_0()) ....... B10
% ~all_on_1(x0) | on_2(a_0(),x0) ....... B40
%  ~all_on_1(sunday_0()) ....... R1 [B10:L0, B40:L1]
% Derivation of unit clause U41:
% ~on_2(a_0(),tuesday_0()) ....... B11
% ~all_on_1(x0) | on_2(a_0(),x0) ....... B40
%  ~all_on_1(tuesday_0()) ....... R1 [B11:L0, B40:L1]
% Derivation of unit clause U43:
% ~on_2(b_0(),saturday_0()) ....... B14
% ~all_on_1(x0) | on_2(b_0(),x0) ....... B41
%  ~all_on_1(saturday_0()) ....... R1 [B14:L0, B41:L1]
% Derivation of unit clause U46:
% ~on_2(a_0(),sunday_0()) ....... B10
% on_2(x0,x1) | on_2(x0,x2) | on_2(x3,x1) | on_2(x3,x2) | same_day_2(x1,x2) | same_person_2(x0,x3) ....... B46
%  on_2(a_0(), x0) | on_2(x1, sunday_0()) | on_2(x1, x0) | same_day_2(sunday_0(), x0) | same_person_2(a_0(), x1) ....... R1 [B10:L0, B46:L0]
%  ~on_2(a_0(),tuesday_0()) ....... U11
%   on_2(x0, sunday_0()) | on_2(x0, tuesday_0()) | same_day_2(sunday_0(), tuesday_0()) | same_person_2(a_0(), x0) ....... R2 [R1:L0, U11:L0]
%   ~on_2(c_0(),sunday_0()) ....... U15
%    on_2(c_0(), tuesday_0()) | same_day_2(sunday_0(), tuesday_0()) | same_person_2(a_0(), c_0()) ....... R3 [R2:L0, U15:L0]
%    ~same_day_2(sunday_0(),tuesday_0()) ....... U17
%     on_2(c_0(), tuesday_0()) | same_person_2(a_0(), c_0()) ....... R4 [R3:L1, U17:L0]
%     ~same_person_2(a_0(),c_0()) ....... U38
%      on_2(c_0(), tuesday_0()) ....... R5 [R4:L1, U38:L0]
% Derivation of unit clause U47:
% ~on_2(a_0(),sunday_0()) ....... B10
% on_2(x0,x1) | on_2(x0,x2) | on_2(x3,x1) | on_2(x3,x2) | same_day_2(x1,x2) | same_person_2(x0,x3) ....... B46
%  on_2(a_0(), x0) | on_2(x1, sunday_0()) | on_2(x1, x0) | same_day_2(sunday_0(), x0) | same_person_2(a_0(), x1) ....... R1 [B10:L0, B46:L0]
%  ~on_2(a_0(),thursday_0()) ....... U12
%   on_2(x0, sunday_0()) | on_2(x0, thursday_0()) | same_day_2(sunday_0(), thursday_0()) | same_person_2(a_0(), x0) ....... R2 [R1:L0, U12:L0]
%   ~on_2(c_0(),sunday_0()) ....... U15
%    on_2(c_0(), thursday_0()) | same_day_2(sunday_0(), thursday_0()) | same_person_2(a_0(), c_0()) ....... R3 [R2:L0, U15:L0]
%    ~same_day_2(sunday_0(),thursday_0()) ....... U19
%     on_2(c_0(), thursday_0()) | same_person_2(a_0(), c_0()) ....... R4 [R3:L1, U19:L0]
%     ~same_person_2(a_0(),c_0()) ....... U38
%      on_2(c_0(), thursday_0()) ....... R5 [R4:L1, U38:L0]
% Derivation of unit clause U48:
% ~on_2(a_0(),sunday_0()) ....... B10
% on_2(x0,x1) | on_2(x0,x2) | on_2(x3,x1) | on_2(x3,x2) | same_day_2(x1,x2) | same_person_2(x0,x3) ....... B46
%  on_2(a_0(), x0) | on_2(x1, sunday_0()) | on_2(x1, x0) | same_day_2(sunday_0(), x0) | same_person_2(a_0(), x1) ....... R1 [B10:L0, B46:L0]
%  ~on_2(a_0(),thursday_0()) ....... U12
%   on_2(x0, sunday_0()) | on_2(x0, thursday_0()) | same_day_2(sunday_0(), thursday_0()) | same_person_2(a_0(), x0) ....... R2 [R1:L0, U12:L0]
%   ~on_2(b_0(),thursday_0()) ....... U13
%    on_2(b_0(), sunday_0()) | same_day_2(sunday_0(), thursday_0()) | same_person_2(a_0(), b_0()) ....... R3 [R2:L1, U13:L0]
%    ~same_day_2(sunday_0(),thursday_0()) ....... U19
%     on_2(b_0(), sunday_0()) | same_person_2(a_0(), b_0()) ....... R4 [R3:L1, U19:L0]
%     ~same_person_2(a_0(),b_0()) ....... U37
%      on_2(b_0(), sunday_0()) ....... R5 [R4:L1, U37:L0]
% Derivation of unit clause U49:
% ~on_2(a_0(),tuesday_0()) ....... B11
% on_2(x0,x1) | on_2(x0,x2) | on_2(x3,x1) | on_2(x3,x2) | same_day_2(x1,x2) | same_person_2(x0,x3) ....... B46
%  on_2(a_0(), x0) | on_2(x1, tuesday_0()) | on_2(x1, x0) | same_day_2(tuesday_0(), x0) | same_person_2(a_0(), x1) ....... R1 [B11:L0, B46:L0]
%  ~on_2(a_0(),thursday_0()) ....... U12
%   on_2(x0, tuesday_0()) | on_2(x0, thursday_0()) | same_day_2(tuesday_0(), thursday_0()) | same_person_2(a_0(), x0) ....... R2 [R1:L0, U12:L0]
%   ~on_2(b_0(),thursday_0()) ....... U13
%    on_2(b_0(), tuesday_0()) | same_day_2(tuesday_0(), thursday_0()) | same_person_2(a_0(), b_0()) ....... R3 [R2:L1, U13:L0]
%    ~same_day_2(tuesday_0(),thursday_0()) ....... U28
%     on_2(b_0(), tuesday_0()) | same_person_2(a_0(), b_0()) ....... R4 [R3:L1, U28:L0]
%     ~same_person_2(a_0(),b_0()) ....... U37
%      on_2(b_0(), tuesday_0()) ....... R5 [R4:L1, U37:L0]
% Derivation of unit clause U57:
% consecutive_2(sunday_0(),monday_0()) ....... B3
% ~consecutive_2(x2,x3) | ~consecutive_2(x1,x2) | ~consecutive_2(x0,x1) | ~on_2(x4,x2) | ~on_2(x4,x1) | ~on_2(x4,x0) ....... B45
%  ~consecutive_2(x0, x1) | ~consecutive_2(monday_0(), x0) | ~on_2(x2, x0) | ~on_2(x2, monday_0()) | ~on_2(x2, sunday_0()) ....... R1 [B3:L0, B45:L2]
%  consecutive_2(tuesday_0(),wednesday_0()) ....... U5
%   ~consecutive_2(monday_0(), tuesday_0()) | ~on_2(x0, tuesday_0()) | ~on_2(x0, monday_0()) | ~on_2(x0, sunday_0()) ....... R2 [R1:L0, U5:L0]
%   consecutive_2(monday_0(),tuesday_0()) ....... U4
%    ~on_2(x0, tuesday_0()) | ~on_2(x0, monday_0()) | ~on_2(x0, sunday_0()) ....... R3 [R2:L0, U4:L0]
%    on_2(b_0(),tuesday_0()) ....... U49
%     ~on_2(b_0(), monday_0()) | ~on_2(b_0(), sunday_0()) ....... R4 [R3:L0, U49:L0]
%     ~all_on_1(x0) | on_2(b_0(),x0) ....... B41
%      ~on_2(b_0(), sunday_0()) | ~all_on_1(monday_0()) ....... R5 [R4:L0, B41:L1]
%      on_2(b_0(),sunday_0()) ....... U48
%       ~all_on_1(monday_0()) ....... R6 [R5:L0, U48:L0]
% Derivation of unit clause U58:
% consecutive_2(tuesday_0(),wednesday_0()) ....... B5
% ~consecutive_2(x2,x3) | ~consecutive_2(x1,x2) | ~consecutive_2(x0,x1) | ~on_2(x4,x2) | ~on_2(x4,x1) | ~on_2(x4,x0) ....... B45
%  ~consecutive_2(x0, x1) | ~consecutive_2(wednesday_0(), x0) | ~on_2(x2, x0) | ~on_2(x2, wednesday_0()) | ~on_2(x2, tuesday_0()) ....... R1 [B5:L0, B45:L2]
%  consecutive_2(thursday_0(),friday_0()) ....... U7
%   ~consecutive_2(wednesday_0(), thursday_0()) | ~on_2(x0, thursday_0()) | ~on_2(x0, wednesday_0()) | ~on_2(x0, tuesday_0()) ....... R2 [R1:L0, U7:L0]
%   consecutive_2(wednesday_0(),thursday_0()) ....... U6
%    ~on_2(x0, thursday_0()) | ~on_2(x0, wednesday_0()) | ~on_2(x0, tuesday_0()) ....... R3 [R2:L0, U6:L0]
%    on_2(c_0(),thursday_0()) ....... U47
%     ~on_2(c_0(), wednesday_0()) | ~on_2(c_0(), tuesday_0()) ....... R4 [R3:L0, U47:L0]
%     ~all_on_1(x0) | on_2(c_0(),x0) ....... B42
%      ~on_2(c_0(), tuesday_0()) | ~all_on_1(wednesday_0()) ....... R5 [R4:L0, B42:L1]
%      on_2(c_0(),tuesday_0()) ....... U46
%       ~all_on_1(wednesday_0()) ....... R6 [R5:L0, U46:L0]
% Derivation of unit clause U59:
% ~all_on_1(friday_0()) ....... B0
% all_on_1(sunday_0()) | all_on_1(monday_0()) | all_on_1(tuesday_0()) | all_on_1(wednesday_0()) | all_on_1(thursday_0()) | all_on_1(friday_0()) | all_on_1(saturday_0()) ....... B47
%  all_on_1(sunday_0()) | all_on_1(monday_0()) | all_on_1(tuesday_0()) | all_on_1(wednesday_0()) | all_on_1(thursday_0()) | all_on_1(saturday_0()) ....... R1 [B0:L0, B47:L5]
%  ~all_on_1(sunday_0()) ....... U40
%   all_on_1(monday_0()) | all_on_1(tuesday_0()) | all_on_1(wednesday_0()) | all_on_1(thursday_0()) | all_on_1(saturday_0()) ....... R2 [R1:L0, U40:L0]
%   ~all_on_1(monday_0()) ....... U57
%    all_on_1(tuesday_0()) | all_on_1(wednesday_0()) | all_on_1(thursday_0()) | all_on_1(saturday_0()) ....... R3 [R2:L0, U57:L0]
%    ~all_on_1(tuesday_0()) ....... U41
%     all_on_1(wednesday_0()) | all_on_1(thursday_0()) | all_on_1(saturday_0()) ....... R4 [R3:L0, U41:L0]
%     ~all_on_1(wednesday_0()) ....... U58
%      all_on_1(thursday_0()) | all_on_1(saturday_0()) ....... R5 [R4:L0, U58:L0]
%      ~all_on_1(x0) | on_2(a_0(),x0) ....... B40
%       all_on_1(saturday_0()) | on_2(a_0(), thursday_0()) ....... R6 [R5:L0, B40:L0]
%       ~all_on_1(saturday_0()) ....... U43
%        on_2(a_0(), thursday_0()) ....... R7 [R6:L0, U43:L0]
% Derivation of the empty clause:
% on_2(a_0(),thursday_0()) ....... U59
% ~on_2(a_0(),thursday_0()) ....... U12
%  [] ....... R1 [U59:L0, U12:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 115892
% 	resolvents: 108393	factors: 7499
% Number of unit clauses generated: 7419
% % unit clauses generated to total clauses generated: 6.40
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 40	[1] = 4		[5] = 13	[6] = 2		[7] = 1		
% Total = 60
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 7419	[2] = 37404	[3] = 53407	[4] = 15135	[5] = 2436	[6] = 70	
% [7] = 21	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] all_on_1		(+)0	(-)7
% [1] consecutive_2	(+)7	(-)4
% [2] on_2		(+)6	(-)6
% [3] same_day_2		(+)3	(-)21
% [4] same_person_2	(+)3	(-)3
% 			------------------
% 		Total:	(+)19	(-)41
% Total number of unit clauses retained: 60
% Number of clauses skipped because of their length: 128094
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 42471
% Number of successful unifications: 115934
% Number of unification failures: 1114477
% Number of unit to unit unification failures: 132
% N literal unification failure due to lookup root_id table: 392270
% N base clause resolution failure due to lookup table: 197795
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 7
% N unit clauses dropped because they exceeded max values: 3953
% 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: 43
% Total number of terms of all unit clauses in table: 113
% 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.38
% Number of symbols (columns) in UCFA: 49
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1230411
% ConstructUnitClause() = 3973
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.53 secs
% 
%------------------------------------------------------------------------------