TSTP Solution File: SYN036-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN036-2 : TPTP v5.0.0. Bugfixed v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 08:23:48 EST 2010
% Result : GaveUp 0.59s
% 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/SystemOnTPTP485/SYN/SYN036-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 = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 0] [nf = 1024] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 0] [nf = 2048] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 0] [nf = 3072] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 0] [nf = 4096] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 0] [nf = 5120] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 0] [nf = 6144] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 0] [nf = 7168] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 0] [nf = 8192] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 0] [nf = 9216] [nu = 0] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 0] [nf = 10240] [nu = 0] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 0] [nf = 11264] [nu = 0] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 0] [nf = 12288] [nu = 0] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 0] [nf = 13312] [nu = 0] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 0] [nf = 14336] [nu = 0] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 0] [nf = 15360] [nu = 0] [ut = 0]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 0] [nf = 16384] [nu = 0] [ut = 0]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 0] [nf = 17408] [nu = 0] [ut = 0]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 0] [nf = 18432] [nu = 0] [ut = 0]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 0] [nf = 19456] [nu = 0] [ut = 0]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 0] [nf = 20480] [nu = 0] [ut = 0]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 0] [nf = 21504] [nu = 0] [ut = 0]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 0] [nf = 22528] [nu = 0] [ut = 0]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 0] [nf = 23552] [nu = 0] [ut = 0]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 0] [nf = 24576] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 0] [nf = 25600] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 0] [nf = 26624] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 0] [nf = 27648] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 0] [nf = 28672] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 0] [nf = 29696] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 0] [nf = 30720] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 0] [nf = 31744] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 0] [nf = 32768] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 0] [nf = 33792] [nu = 0] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 0] [nf = 34816] [nu = 0] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 0] [nf = 35840] [nu = 0] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 0] [nf = 36864] [nu = 0] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 0] [nf = 37888] [nu = 0] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 0] [nf = 38912] [nu = 0] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 0] [nf = 39936] [nu = 0] [ut = 0]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 0] [nf = 40960] [nu = 0] [ut = 0]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 0] [nf = 41984] [nu = 0] [ut = 0]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 0] [nf = 43008] [nu = 0] [ut = 0]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 0] [nf = 44032] [nu = 0] [ut = 0]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 0] [nf = 45056] [nu = 0] [ut = 0]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 0] [nf = 46080] [nu = 0] [ut = 0]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 0] [nf = 47104] [nu = 0] [ut = 0]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 0] [nf = 48128] [nu = 0] [ut = 0]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 0] [nf = 49152] [nu = 0] [ut = 0]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 49152
% resolvents: 0 factors: 49152
% 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]:
% =============================================================
% Total = 0
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [7] = 49152
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] big_p_1 (+)0 (-)0
% [1] big_q_1 (+)0 (-)0
% ------------------
% Total: (+)0 (-)0
% Total number of unit clauses retained: 0
% Number of clauses skipped because of their length: 0
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 49152
% Number of unification failures: 11904
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 14976
% 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: 1
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 0
% Total number of terms of all unit clauses in table: 0
% 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: nan
% Number of symbols (columns) in UCFA: 60
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 61056
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.58 secs
%
%------------------------------------------------------------------------------