TSTP Solution File: PUZ056-2.010 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ056-2.010 : TPTP v5.0.0. Released v3.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 28 04:13:34 EST 2010
% Result : Timeout 300.01s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP10136/PUZ/PUZ056-2.010+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 = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 9]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 6] [nf = 0] [nu = 4] [ut = 11]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 34] [nf = 4] [nu = 12] [ut = 11]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 648] [nf = 14] [nu = 276] [ut = 27]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 6466] [nf = 192] [nu = 3020] [ut = 27]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 135478] [nf = 542] [nu = 52520] [ut = 75]
% Looking for a proof at depth = 6 ...
% t = 8 secs [nr = 1752088] [nf = 2948] [nu = 621520] [ut = 75]
% Looking for a proof at depth = 7 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 32988092
% resolvents: 32895989 factors: 92103
% Number of unit clauses generated: 11306666
% % unit clauses generated to total clauses generated: 34.27
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 9 [1] = 2 [3] = 16
% [5] = 48 [7] = 144
% Total = 219
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 11306666 [2] = 15786103 [3] = 4787018 [4] = 937251 [5] = 155006 [6] = 15668
% [7] = 376 [8] = 4
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] neq_2 (+)6 (-)3
% [1] p_10 (+)105 (-)105
% ------------------
% Total: (+)111 (-)108
% Total number of unit clauses retained: 219
% Number of clauses skipped because of their length: 5909245
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 32988092
% Number of unification failures: 1003221533
% Number of unit to unit unification failures: 11043
% N literal unification failure due to lookup root_id table: 39845003
% N base clause resolution failure due to lookup table: 99
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 70
% N unit clauses dropped because they exceeded max values: 9976220
% 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: 10
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 1377
% Total number of terms of all unit clauses in table: 2118
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.02
% Ratio n states used/total unit clauses terms: 0.65
% Number of symbols (columns) in UCFA: 39
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1036209625
% ConstructUnitClause() = 9976430
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 16.20 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 109960
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------