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

View Problem - Process Solution

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

% Computer : art01.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 10:31:58 EST 2010

% Result   : Unsatisfiable 0.21s
% Output   : Refutation 0.21s
% 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/SystemOnTPTP25420/SYN/SYN583-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 = 187] [nf = 0] [nu = 154] [ut = 105]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 7556] [nf = 16] [nu = 5381] [ut = 876]
% Looking for a proof at depth = 3 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: p2_2(x0,x0)
% B1: p5_2(x0,x0)
% B15: ~p2_2(x1,x3) | ~p5_2(x0,x2) | p2_2(f6_2(x0,x1),f6_2(x2,x3))
% B16: ~p2_2(x2,x1) | ~p2_2(x2,x0) | p2_2(x0,x1)
% B21: ~p11_2(x2,x3) | ~p2_2(x3,x1) | ~p2_2(x2,x0) | p11_2(x0,x1)
% Unit Clauses:
% --------------
% U2: < d0 v0 dv0 f0 c2 t2 td1 b nc > p2_2(c13_0(),c18_0())
% U4: < d0 v0 dv0 f2 c3 t5 td3 b nc > p11_2(f4_1(f6_2(c15_0(),c13_0())),c16_0())
% U5: < d0 v0 dv0 f2 c3 t5 td3 b nc > ~p11_2(f4_1(f6_2(c15_0(),c18_0())),c16_0())
% U106: < d2 v0 dv0 f0 c2 t2 td1 > p2_2(c18_0(),c13_0())
% U205: < d2 v2 dv1 f2 c2 t6 td2 > p2_2(f6_2(x0,c18_0()),f6_2(x0,c13_0()))
% U1446: < d3 v2 dv1 f4 c2 t8 td3 > p2_2(f4_1(f6_2(x0,c13_0())),f4_1(f6_2(x0,c18_0())))
% U1682: < d3 v0 dv0 f2 c3 t5 td3 > p11_2(f4_1(f6_2(c15_0(),c18_0())),c16_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U2:
% p2_2(c13_0(),c18_0()) ....... U2
% Derivation of unit clause U4:
% p11_2(f4_1(f6_2(c15_0(),c13_0())),c16_0()) ....... U4
% Derivation of unit clause U5:
% ~p11_2(f4_1(f6_2(c15_0(),c18_0())),c16_0()) ....... U5
% Derivation of unit clause U106:
% p2_2(x0,x0) ....... B0
% ~p2_2(x2,x1) | ~p2_2(x2,x0) | p2_2(x0,x1) ....... B16
%  ~p2_2(x0, x1) | p2_2(x1, x0) ....... R1 [B0:L0, B16:L0]
%  p2_2(c13_0(),c18_0()) ....... U2
%   p2_2(c18_0(), c13_0()) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U205:
% p5_2(x0,x0) ....... B1
% ~p2_2(x1,x3) | ~p5_2(x0,x2) | p2_2(f6_2(x0,x1),f6_2(x2,x3)) ....... B15
%  ~p2_2(x0, x1) | p2_2(f6_2(x2, x0), f6_2(x2, x1)) ....... R1 [B1:L0, B15:L1]
%  p2_2(c18_0(),c13_0()) ....... U106
%   p2_2(f6_2(x0, c18_0()), f6_2(x0, c13_0())) ....... R2 [R1:L0, U106:L0]
% Derivation of unit clause U1446:
% p2_2(x0,x0) ....... B0
% ~p2_2(x2,x1) | ~p2_2(x2,x0) | p2_2(x0,x1) ....... B16
%  ~p2_2(x0, x1) | p2_2(x1, x0) ....... R1 [B0:L0, B16:L0]
%  ~p2_2(x0,x1) | p2_2(f4_1(x0),f4_1(x1)) ....... B12
%   ~p2_2(x0, x1) | p2_2(f4_1(x1), f4_1(x0)) ....... R2 [R1:L1, B12:L0]
%   p2_2(f6_2(x0,c18_0()),f6_2(x0,c13_0())) ....... U205
%    p2_2(f4_1(f6_2(x0, c13_0())), f4_1(f6_2(x0, c18_0()))) ....... R3 [R2:L0, U205:L0]
% Derivation of unit clause U1682:
% p2_2(x0,x0) ....... B0
% ~p11_2(x2,x3) | ~p2_2(x3,x1) | ~p2_2(x2,x0) | p11_2(x0,x1) ....... B21
%  ~p11_2(x0, x1) | ~p2_2(x0, x2) | p11_2(x2, x1) ....... R1 [B0:L0, B21:L1]
%  p11_2(f4_1(f6_2(c15_0(),c13_0())),c16_0()) ....... U4
%   ~p2_2(f4_1(f6_2(c15_0(), c13_0())), x0) | p11_2(x0, c16_0()) ....... R2 [R1:L0, U4:L0]
%   p2_2(f4_1(f6_2(x0,c13_0())),f4_1(f6_2(x0,c18_0()))) ....... U1446
%    p11_2(f4_1(f6_2(c15_0(), c18_0())), c16_0()) ....... R3 [R2:L0, U1446:L0]
% Derivation of the empty clause:
% p11_2(f4_1(f6_2(c15_0(),c18_0())),c16_0()) ....... U1682
% ~p11_2(f4_1(f6_2(c15_0(),c18_0())),c16_0()) ....... U5
%  [] ....... R1 [U1682:L0, U5:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 17006
% 	resolvents: 16979	factors: 27
% Number of unit clauses generated: 14700
% % unit clauses generated to total clauses generated: 86.44
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 9		[1] = 96	[2] = 771	[3] = 807	
% Total = 1683
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 14700	[2] = 2239	[3] = 67	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p11_2		(+)837	(-)1
% [1] p12_2		(+)0	(-)1
% [2] p2_2		(+)836	(-)2
% [3] p5_2		(+)1	(-)0
% [4] p7_2		(+)5	(-)0
% [5] p10_3		(+)0	(-)0
% 			------------------
% 		Total:	(+)1679	(-)4
% Total number of unit clauses retained: 1683
% Number of clauses skipped because of their length: 453
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 17016
% Number of unification failures: 2690
% Number of unit to unit unification failures: 2508
% N literal unification failure due to lookup root_id table: 819
% N base clause resolution failure due to lookup table: 441
% N UC-BCL resolution dropped due to lookup table: 62
% Max entries in substitution set: 7
% N unit clauses dropped because they exceeded max values: 10706
% N unit clauses dropped because too much nesting: 5547
% 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: 12
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 4384
% Total number of terms of all unit clauses in table: 16443
% Max allowed number of states in UCFA: 112000
% Ratio n states used/total allowed states: 0.04
% Ratio n states used/total unit clauses terms: 0.27
% Number of symbols (columns) in UCFA: 51
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 19706
% ConstructUnitClause() = 12380
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.04 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.20 secs
% 
%------------------------------------------------------------------------------