TSTP Solution File: SYN775-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN775-1 : TPTP v5.0.0. Released v2.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 11:47:20 EST 2010
% Result : GaveUp 0.24s
% 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/SystemOnTPTP12528/SYN/SYN775-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 = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 10] [nf = 8] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 176] [nf = 76] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 688] [nf = 188] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 1200] [nf = 300] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 1712] [nf = 412] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 2224] [nf = 524] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 2736] [nf = 636] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 3248] [nf = 748] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 3760] [nf = 860] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 4272] [nf = 972] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 4784] [nf = 1084] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 5296] [nf = 1196] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 5808] [nf = 1308] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 6320] [nf = 1420] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 6832] [nf = 1532] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 7344] [nf = 1644] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 7856] [nf = 1756] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 8368] [nf = 1868] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 8880] [nf = 1980] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 9392] [nf = 2092] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 9904] [nf = 2204] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 10416] [nf = 2316] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 10928] [nf = 2428] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 11440] [nf = 2540] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 11952] [nf = 2652] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 12464] [nf = 2764] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 12976] [nf = 2876] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 12976] [nf = 2876] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 12976] [nf = 2876] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 12986] [nf = 2876] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 13078] [nf = 2940] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 13490] [nf = 3156] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 14732] [nf = 3416] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 15974] [nf = 3676] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 17216] [nf = 3936] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 18458] [nf = 4196] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 19700] [nf = 4456] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 20942] [nf = 4716] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 22184] [nf = 4976] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 23426] [nf = 5236] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 24668] [nf = 5496] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 25910] [nf = 5756] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 27152] [nf = 6016] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 28394] [nf = 6276] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 29636] [nf = 6536] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 30878] [nf = 6796] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 32120] [nf = 7056] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 33362] [nf = 7316] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 34604] [nf = 7576] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 35846] [nf = 7836] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 37088] [nf = 8096] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 38330] [nf = 8356] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 39572] [nf = 8616] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 40814] [nf = 8876] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 42056] [nf = 9136] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 43298] [nf = 9396] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 44540] [nf = 9656] [nu = 0] [ut = 2]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 54196
% resolvents: 44540 factors: 9656
% 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] = 2
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 27104 [5] = 21700 [6] = 5392
% Average size of a generated clause: 5.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] ssRr_2 (+)2 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 456
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 54196
% Number of unification failures: 30672
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 6464
% N base clause resolution failure due to lookup table: 0
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% 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: 7
% Total number of terms of all unit clauses in table: 6
% 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.17
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 84868
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.24 secs
%
%------------------------------------------------------------------------------