TSTP Solution File: SYN754-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN754-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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 11:38:06 EST 2010
% Result : GaveUp 82.34s
% 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/SystemOnTPTP12470/SYN/SYN754-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 = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 8] [nf = 8] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 234] [nf = 86] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2086] [nf = 328] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 9816] [nf = 732] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 45180] [nf = 1290] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 80544] [nf = 1848] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 115908] [nf = 2406] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 151272] [nf = 2964] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 186636] [nf = 3522] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 222000] [nf = 4080] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 257364] [nf = 4638] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 292728] [nf = 5196] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 328092] [nf = 5754] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 363456] [nf = 6312] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 398820] [nf = 6870] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 434184] [nf = 7428] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 469548] [nf = 7986] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 504912] [nf = 8544] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 540276] [nf = 9102] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 575640] [nf = 9660] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 611004] [nf = 10218] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 646368] [nf = 10776] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 681732] [nf = 11334] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 717096] [nf = 11892] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 752460] [nf = 12450] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 787824] [nf = 13008] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 787824] [nf = 13008] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 787824] [nf = 13008] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 787824] [nf = 13008] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 787832] [nf = 13008] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 787886] [nf = 13084] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 788390] [nf = 13522] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 792188] [nf = 14550] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 808522] [nf = 16304] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 884500] [nf = 18580] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 2 secs [nr = 961888] [nf = 24666] [n
% u = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 2 secs [nr = 1054012] [nf = 63324] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 3 secs [nr = 1230380] [nf = 183746] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 5 secs [nr = 1641324] [nf = 641896] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 8 secs [nr = 2547892] [nf = 1100046] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 11 secs [nr = 3455180] [nf = 1559924] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 15 secs [nr = 4391892] [nf = 2095114] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 19 secs [nr = 5411068] [nf = 2745216] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 24 secs [nr = 6533636] [nf = 3534422] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 29 secs [nr = 7695948] [nf = 4323628] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 34 secs [nr = 8858260] [nf = 5112834] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 39 secs [nr = 10020572] [nf = 5902040] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 44 secs [nr = 11182884] [nf = 6691246] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 49 secs [nr = 12345196] [nf = 7480452] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 54 secs [nr = 13507508] [nf = 8269658] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 59 secs [nr = 14669820] [nf = 9058864] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 64 secs [nr = 15832132] [nf = 9848070] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 69 secs [nr = 16994444] [nf = 10637276] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 74 secs [nr = 18156756] [nf = 11426482] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 79 secs [nr = 19319068] [nf = 12215688] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 84 secs [nr = 20481380] [nf = 13004894] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 33486274
% resolvents: 20481380 factors: 13004894
% Number of unit clauses generated: 0
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 763064 [5] = 1517056 [6] = 3640948 [7] = 10450842 [8] = 13003234 [9] = 4111130
% Average size of a generated clause: 8.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssPv1_1 (+)0 (-)0
% [1] ssPv2_1 (+)0 (-)0
% [2] ssPv3_1 (+)0 (-)0
% [3] ssPv4_1 (+)0 (-)0
% [4] ssPv5_1 (+)0 (-)0
% [5] ssPv6_1 (+)0 (-)0
% [6] ssPv7_1 (+)0 (-)0
% [7] ssPv8_1 (+)0 (-)0
% [8] ssRr_2 (+)1 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 1778000
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 33486274
% Number of unification failures: 25220974
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 77911636
% N base clause resolution failure due to lookup table: 1668510
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 22
% N unit clauses dropped because they exceeded max values: 0
% 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: 3
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 5
% Total number of terms of all unit clauses in table: 3
% 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: 1.67
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 58707248
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 408369
% | |
% --------------------------------------------------------
% Elapsed time: 84 secs
% CPU time: 82.32 secs
%
%------------------------------------------------------------------------------