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

View Problem - Process Solution

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

% Computer : art09.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:28:31 EST 2010

% Result   : Unsatisfiable 0.16s
% Output   : Refutation 0.16s
% 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/SystemOnTPTP31642/SYN/SYN069-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 = 5] [nf = 0] [nu = 3] [ut = 4]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 19] [nf = 0] [nu = 9] [ut = 5]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 50] [nf = 2] [nu = 21] [ut = 6]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 248] [nf = 10] [nu = 61] [ut = 9]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 2826] [nf = 199] [nu = 600] [ut = 10]
% Looking for a proof at depth = 6 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~big_f_1(x0) | big_g_1(g_1(x0))
% B1: ~big_f_1(x0) | big_h_2(x0,g_1(x0))
% B2: big_f_1(a_0())
% B3: ~big_k_1(x0) | ~big_l_1(x0)
% B4: ~big_h_2(a_0(),x0) | big_l_1(x0)
% B6: ~big_f_1(x0) | ~big_g_1(x1) | ~big_h_2(x0,x1) | big_g_1(f_1(x0)) | big_k_1(x1)
% B7: ~big_f_1(x0) | ~big_g_1(x1) | ~big_h_2(x0,x1) | big_k_1(x1) | big_h_2(x0,f_1(x0))
% B8: ~big_f_1(x0) | ~big_g_1(x1) | ~big_h_2(x0,x1) | ~big_j_2(x0,f_1(x0)) | big_k_1(x1)
% Unit Clauses:
% --------------
% U0: < d0 v0 dv0 f0 c1 t1 td1 b > big_f_1(a_0())
% U1: < d1 v0 dv0 f1 c1 t2 td2 > big_g_1(g_1(a_0()))
% U2: < d1 v0 dv0 f1 c2 t3 td2 > big_h_2(a_0(),g_1(a_0()))
% U4: < d2 v0 dv0 f1 c1 t2 td2 > ~big_k_1(g_1(a_0()))
% U7: < d4 v0 dv0 f1 c2 t3 td2 > big_h_2(a_0(),f_1(a_0()))
% U8: < d4 v0 dv0 f1 c2 t3 td2 > ~big_j_2(a_0(),f_1(a_0()))
% U10: < d6 v0 dv0 f1 c2 t3 td2 > big_j_2(a_0(),f_1(a_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% big_f_1(a_0()) ....... U0
% Derivation of unit clause U1:
% ~big_f_1(x0) | big_g_1(g_1(x0)) ....... B0
% big_f_1(a_0()) ....... U0
%  big_g_1(g_1(a_0())) ....... R1 [B0:L0, U0:L0]
% Derivation of unit clause U2:
% ~big_f_1(x0) | big_h_2(x0,g_1(x0)) ....... B1
% big_f_1(a_0()) ....... U0
%  big_h_2(a_0(), g_1(a_0())) ....... R1 [B1:L0, U0:L0]
% Derivation of unit clause U4:
% ~big_k_1(x0) | ~big_l_1(x0) ....... B3
% ~big_h_2(a_0(),x0) | big_l_1(x0) ....... B4
%  ~big_k_1(x0) | ~big_h_2(a_0(), x0) ....... R1 [B3:L1, B4:L1]
%  big_h_2(a_0(),g_1(a_0())) ....... U2
%   ~big_k_1(g_1(a_0())) ....... R2 [R1:L1, U2:L0]
% Derivation of unit clause U7:
% big_f_1(a_0()) ....... B2
% ~big_f_1(x0) | ~big_g_1(x1) | ~big_h_2(x0,x1) | big_k_1(x1) | big_h_2(x0,f_1(x0)) ....... B7
%  ~big_g_1(x0) | ~big_h_2(a_0(), x0) | big_k_1(x0) | big_h_2(a_0(), f_1(a_0())) ....... R1 [B2:L0, B7:L0]
%  big_g_1(g_1(a_0())) ....... U1
%   ~big_h_2(a_0(), g_1(a_0())) | big_k_1(g_1(a_0())) | big_h_2(a_0(), f_1(a_0())) ....... R2 [R1:L0, U1:L0]
%   big_h_2(a_0(),g_1(a_0())) ....... U2
%    big_k_1(g_1(a_0())) | big_h_2(a_0(), f_1(a_0())) ....... R3 [R2:L0, U2:L0]
%    ~big_k_1(g_1(a_0())) ....... U4
%     big_h_2(a_0(), f_1(a_0())) ....... R4 [R3:L0, U4:L0]
% Derivation of unit clause U8:
% big_f_1(a_0()) ....... B2
% ~big_f_1(x0) | ~big_g_1(x1) | ~big_h_2(x0,x1) | ~big_j_2(x0,f_1(x0)) | big_k_1(x1) ....... B8
%  ~big_g_1(x0) | ~big_h_2(a_0(), x0) | ~big_j_2(a_0(), f_1(a_0())) | big_k_1(x0) ....... R1 [B2:L0, B8:L0]
%  big_g_1(g_1(a_0())) ....... U1
%   ~big_h_2(a_0(), g_1(a_0())) | ~big_j_2(a_0(), f_1(a_0())) | big_k_1(g_1(a_0())) ....... R2 [R1:L0, U1:L0]
%   big_h_2(a_0(),g_1(a_0())) ....... U2
%    ~big_j_2(a_0(), f_1(a_0())) | big_k_1(g_1(a_0())) ....... R3 [R2:L0, U2:L0]
%    ~big_k_1(g_1(a_0())) ....... U4
%     ~big_j_2(a_0(), f_1(a_0())) ....... R4 [R3:L1, U4:L0]
% Derivation of unit clause U10:
% big_f_1(a_0()) ....... B2
% ~big_f_1(x0) | ~big_g_1(x1) | ~big_h_2(x0,x1) | big_g_1(f_1(x0)) | big_k_1(x1) ....... B6
%  ~big_g_1(x0) | ~big_h_2(a_0(), x0) | big_g_1(f_1(a_0())) | big_k_1(x0) ....... R1 [B2:L0, B6:L0]
%  big_g_1(g_1(a_0())) ....... U1
%   ~big_h_2(a_0(), g_1(a_0())) | big_g_1(f_1(a_0())) | big_k_1(g_1(a_0())) ....... R2 [R1:L0, U1:L0]
%   ~big_g_1(x0) | ~big_h_2(a_0(),x0) | big_j_2(a_0(),x0) ....... B5
%    ~big_h_2(a_0(), g_1(a_0())) | big_k_1(g_1(a_0())) | ~big_h_2(a_0(), f_1(a_0())) | big_j_2(a_0(), f_1(a_0())) ....... R3 [R2:L1, B5:L0]
%    big_h_2(a_0(),g_1(a_0())) ....... U2
%     big_k_1(g_1(a_0())) | ~big_h_2(a_0(), f_1(a_0())) | big_j_2(a_0(), f_1(a_0())) ....... R4 [R3:L0, U2:L0]
%     ~big_k_1(g_1(a_0())) ....... U4
%      ~big_h_2(a_0(), f_1(a_0())) | big_j_2(a_0(), f_1(a_0())) ....... R5 [R4:L0, U4:L0]
%      big_h_2(a_0(),f_1(a_0())) ....... U7
%       big_j_2(a_0(), f_1(a_0())) ....... R6 [R5:L0, U7:L0]
% Derivation of the empty clause:
% big_j_2(a_0(),f_1(a_0())) ....... U10
% ~big_j_2(a_0(),f_1(a_0())) ....... U8
%  [] ....... R1 [U10:L0, U8:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 8770
% 	resolvents: 8331	factors: 439
% Number of unit clauses generated: 2007
% % unit clauses generated to total clauses generated: 22.88
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1		[1] = 3		[2] = 1		[3] = 1		
% [4] = 3		[5] = 1		[6] = 1		
% Total = 11
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 2007	[2] = 3748	[3] = 2266	[4] = 617	[5] = 123	[6] = 9	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] big_f_1		(+)1	(-)0
% [1] big_g_1		(+)2	(-)0
% [2] big_k_1		(+)0	(-)1
% [3] big_l_1		(+)2	(-)0
% [4] big_h_2		(+)2	(-)0
% [5] big_j_2		(+)2	(-)1
% 			------------------
% 		Total:	(+)9	(-)2
% Total number of unit clauses retained: 11
% Number of clauses skipped because of their length: 5318
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 341
% Number of successful unifications: 8788
% Number of unification failures: 2662
% Number of unit to unit unification failures: 1
% N literal unification failure due to lookup root_id table: 39061
% N base clause resolution failure due to lookup table: 8690
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 5
% N unit clauses dropped because they exceeded max values: 1728
% 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: 23
% Total number of terms of all unit clauses in table: 26
% 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.88
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 11450
% ConstructUnitClause() = 1738
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.16 secs
% 
%------------------------------------------------------------------------------