TSTP Solution File: SYN009-2 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN009-2 : 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 08:22:07 EST 2010

% Result   : Unsatisfiable 0.14s
% Output   : Refutation 0.14s
% 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/SystemOnTPTP25651/SYN/SYN009-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 = 0 secs [nr = 6] [nf = 0] [nu = 6] [ut = 7]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 12] [nf = 0] [nu = 12] [ut = 7]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 18] [nf = 0] [nu = 18] [ut = 7]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 24] [nf = 0] [nu = 24] [ut = 7]
% Looking for a proof at depth = 5 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: s_1(a_0())
% B3: t_3(c_0(),c_0(),c_0())
% B4: ~p_3(x0,x1,x2) | ~t_3(x0,x1,x2)
% B5: ~q_3(x0,x1,x2) | ~t_3(x1,x2,x0)
% B6: ~r_3(x0,x1,x2) | ~t_3(x2,x0,x1)
% B7: ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | p_3(x0,x1,x2) | q_3(x1,x2,x0) | r_3(x2,x0,x1)
% Unit Clauses:
% --------------
% U2: < d0 v0 dv0 f0 c1 t1 td1 b nc > s_1(c_0())
% U4: < d1 v0 dv0 f0 c3 t3 td1 > ~p_3(c_0(),c_0(),c_0())
% U5: < d1 v0 dv0 f0 c3 t3 td1 > ~q_3(c_0(),c_0(),c_0())
% U6: < d1 v0 dv0 f0 c3 t3 td1 > ~r_3(c_0(),c_0(),c_0())
% U7: < d5 v0 dv0 f0 c3 t3 td1 > r_3(c_0(),c_0(),c_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U2:
% s_1(c_0()) ....... U2
% Derivation of unit clause U4:
% t_3(c_0(),c_0(),c_0()) ....... B3
% ~p_3(x0,x1,x2) | ~t_3(x0,x1,x2) ....... B4
%  ~p_3(c_0(), c_0(), c_0()) ....... R1 [B3:L0, B4:L1]
% Derivation of unit clause U5:
% t_3(c_0(),c_0(),c_0()) ....... B3
% ~q_3(x0,x1,x2) | ~t_3(x1,x2,x0) ....... B5
%  ~q_3(c_0(), c_0(), c_0()) ....... R1 [B3:L0, B5:L1]
% Derivation of unit clause U6:
% t_3(c_0(),c_0(),c_0()) ....... B3
% ~r_3(x0,x1,x2) | ~t_3(x2,x0,x1) ....... B6
%  ~r_3(c_0(), c_0(), c_0()) ....... R1 [B3:L0, B6:L1]
% Derivation of unit clause U7:
% ~s_1(x2) | ~s_1(x1) | ~s_1(x0) | p_3(x0,x1,x2) | q_3(x1,x2,x0) | r_3(x2,x0,x1) ....... B7
%  ~s_1(x0) | ~s_1(x1) | p_3(x1, x0, x0) | q_3(x0, x0, x1) | r_3(x0, x1, x0) ....... R1 [B7:L0, B7:L1]
%  s_1(c_0()) ....... U2
%   ~s_1(x0) | p_3(x0, c_0(), c_0()) | q_3(c_0(), c_0(), x0) | r_3(c_0(), x0, c_0()) ....... R2 [R1:L0, U2:L0]
%   s_1(c_0()) ....... U2
%    p_3(c_0(), c_0(), c_0()) | q_3(c_0(), c_0(), c_0()) | r_3(c_0(), c_0(), c_0()) ....... R3 [R2:L0, U2:L0]
%    ~p_3(c_0(),c_0(),c_0()) ....... U4
%     q_3(c_0(), c_0(), c_0()) | r_3(c_0(), c_0(), c_0()) ....... R4 [R3:L0, U4:L0]
%     ~q_3(c_0(),c_0(),c_0()) ....... U5
%      r_3(c_0(), c_0(), c_0()) ....... R5 [R4:L0, U5:L0]
% Derivation of the empty clause:
% r_3(c_0(),c_0(),c_0()) ....... U7
% ~r_3(c_0(),c_0(),c_0()) ....... U6
%  [] ....... R1 [U7:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 69
% 	resolvents: 68	factors: 1
% Number of unit clauses generated: 31
% % unit clauses generated to total clauses generated: 44.93
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4		[1] = 3		[5] = 1		
% Total = 8
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 31	[2] = 1	[3] = 33	[4] = 3	[5] = 1	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] s_1		(+)3	(-)0
% [1] p_3		(+)0	(-)1
% [2] q_3		(+)0	(-)1
% [3] r_3		(+)1	(-)1
% [4] t_3		(+)1	(-)0
% 			------------------
% 		Total:	(+)5	(-)3
% Total number of unit clauses retained: 8
% Number of clauses skipped because of their length: 24
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 77
% Number of unification failures: 30
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 135
% N base clause resolution failure due to lookup table: 75
% 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: 3
% 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: 1
% Number of states in UCFA table: 19
% Total number of terms of all unit clauses in table: 18
% 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.06
% Number of symbols (columns) in UCFA: 42
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 107
% ConstructUnitClause() = 7
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.14 secs
% 
%------------------------------------------------------------------------------