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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN726-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:33:45 EST 2010

% Result   : Unsatisfiable 0.54s
% Output   : Refutation 0.54s
% 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/SystemOnTPTP10028/SYN/SYN726-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 = 11] [nf = 0] [nu = 7] [ut = 6]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 69] [nf = 8] [nu = 26] [ut = 7]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 557] [nf = 58] [nu = 181] [ut = 11]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 3947] [nf = 382] [nu = 1070] [ut = 11]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 27732] [nf = 3020] [nu = 6254] [ut = 11]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 193380] [nf = 19928] [nu = 38267] [ut = 11]
% Looking for a proof at depth = 7 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~p_2(sk1_0(),sk2_0())
% B1: p_2(x0,x1) | q_2(x0,x1)
% B2: ~q_2(x1,x0) | q_2(x0,x1)
% B3: ~p_2(x2,x1) | ~p_2(x0,x2) | p_2(x0,x1)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c2 t2 td1 b nc > ~q_2(sk3_0(),sk4_0())
% U2: < d1 v0 dv0 f0 c2 t2 td1 > q_2(sk1_0(),sk2_0())
% U4: < d1 v0 dv0 f0 c2 t2 td1 > q_2(sk2_0(),sk1_0())
% U5: < d1 v0 dv0 f0 c2 t2 td1 > ~q_2(sk4_0(),sk3_0())
% U11: < d7 v1 dv1 f0 c1 t2 td1 > q_2(sk1_0(),x0)
% U12: < d7 v1 dv1 f0 c1 t2 td1 > q_2(x0,sk2_0())
% U17: < d7 v0 dv0 f0 c2 t2 td1 > ~p_2(sk1_0(),sk3_0())
% U19: < d7 v0 dv0 f0 c2 t2 td1 > ~p_2(sk4_0(),sk2_0())
% U22: < d7 v0 dv0 f0 c2 t2 td1 > ~q_2(sk4_0(),sk1_0())
% U28: < d7 v0 dv0 f0 c2 t2 td1 > q_2(sk4_0(),sk1_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% ~q_2(sk3_0(),sk4_0()) ....... U1
% Derivation of unit clause U2:
% ~p_2(sk1_0(),sk2_0()) ....... B0
% p_2(x0,x1) | q_2(x0,x1) ....... B1
%  q_2(sk1_0(), sk2_0()) ....... R1 [B0:L0, B1:L0]
% Derivation of unit clause U4:
% ~q_2(x1,x0) | q_2(x0,x1) ....... B2
% q_2(sk1_0(),sk2_0()) ....... U2
%  q_2(sk2_0(), sk1_0()) ....... R1 [B2:L0, U2:L0]
% Derivation of unit clause U5:
% ~q_2(x1,x0) | q_2(x0,x1) ....... B2
% ~q_2(sk3_0(),sk4_0()) ....... U1
%  ~q_2(sk4_0(), sk3_0()) ....... R1 [B2:L1, U1:L0]
% Derivation of unit clause U11:
% ~p_2(sk1_0(),sk2_0()) ....... B0
% ~p_2(x2,x1) | ~p_2(x0,x2) | p_2(x0,x1) ....... B3
%  ~p_2(x0, sk2_0()) | ~p_2(sk1_0(), x0) ....... R1 [B0:L0, B3:L2]
%  p_2(x0,x1) | q_2(x0,x1) ....... B1
%   ~p_2(sk1_0(), x0) | q_2(x0, sk2_0()) ....... R2 [R1:L0, B1:L0]
%   p_2(x0,x1) | q_2(x0,x1) ....... B1
%    q_2(x0, sk2_0()) | q_2(sk1_0(), x0) ....... R3 [R2:L0, B1:L0]
%    ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%     q_2(sk1_0(), x0) | q_2(sk2_0(), x0) ....... R4 [R3:L0, B2:L0]
%     ~q_2(x2,x1) | ~q_2(x0,x2) | q_2(x0,x1) ....... B4
%      q_2(sk1_0(), x0) | ~q_2(x1, sk2_0()) | q_2(x1, x0) ....... R5 [R4:L1, B4:L0]
%       ~q_2(sk1_0(), sk2_0()) | q_2(sk1_0(), x0) ....... R6 [R5:L0, R5:L2]
%       q_2(sk1_0(),sk2_0()) ....... U2
%        q_2(sk1_0(), x0) ....... R7 [R6:L0, U2:L0]
% Derivation of unit clause U12:
% ~p_2(sk1_0(),sk2_0()) ....... B0
% ~p_2(x2,x1) | ~p_2(x0,x2) | p_2(x0,x1) ....... B3
%  ~p_2(x0, sk2_0()) | ~p_2(sk1_0(), x0) ....... R1 [B0:L0, B3:L2]
%  p_2(x0,x1) | q_2(x0,x1) ....... B1
%   ~p_2(sk1_0(), x0) | q_2(x0, sk2_0()) ....... R2 [R1:L0, B1:L0]
%   p_2(x0,x1) | q_2(x0,x1) ....... B1
%    q_2(x0, sk2_0()) | q_2(sk1_0(), x0) ....... R3 [R2:L0, B1:L0]
%    ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%     q_2(x0, sk2_0()) | q_2(x0, sk1_0()) ....... R4 [R3:L1, B2:L0]
%     ~q_2(x2,x1) | ~q_2(x0,x2) | q_2(x0,x1) ....... B4
%      q_2(x0, sk2_0()) | ~q_2(sk1_0(), x1) | q_2(x0, x1) ....... R5 [R4:L1, B4:L1]
%       ~q_2(sk1_0(), sk2_0()) | q_2(x0, sk2_0()) ....... R6 [R5:L0, R5:L2]
%       q_2(sk1_0(),sk2_0()) ....... U2
%        q_2(x0, sk2_0()) ....... R7 [R6:L0, U2:L0]
% Derivation of unit clause U17:
% ~p_2(sk1_0(),sk2_0()) ....... B0
% ~p_2(x2,x1) | ~p_2(x0,x2) | p_2(x0,x1) ....... B3
%  ~p_2(x0, sk2_0()) | ~p_2(sk1_0(), x0) ....... R1 [B0:L0, B3:L2]
%  p_2(x0,x1) | q_2(x0,x1) ....... B1
%   ~p_2(sk1_0(), x0) | q_2(x0, sk2_0()) ....... R2 [R1:L0, B1:L0]
%   ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%    ~p_2(sk1_0(), x0) | q_2(sk2_0(), x0) ....... R3 [R2:L1, B2:L0]
%    ~q_2(x2,x1) | ~q_2(x0,x2) | q_2(x0,x1) ....... B4
%     ~p_2(sk1_0(), x0) | ~q_2(x1, sk2_0()) | q_2(x1, x0) ....... R4 [R3:L1, B4:L0]
%     q_2(x0,sk2_0()) ....... U12
%      ~p_2(sk1_0(), x0) | q_2(x1, x0) ....... R5 [R4:L1, U12:L0]
%      ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%       ~p_2(sk1_0(), x0) | q_2(x0, x1) ....... R6 [R5:L1, B2:L0]
%       ~q_2(sk3_0(),sk4_0()) ....... U1
%        ~p_2(sk1_0(), sk3_0()) ....... R7 [R6:L1, U1:L0]
% Derivation of unit clause U19:
% ~p_2(sk1_0(),sk2_0()) ....... B0
% ~p_2(x2,x1) | ~p_2(x0,x2) | p_2(x0,x1) ....... B3
%  ~p_2(x0, sk2_0()) | ~p_2(sk1_0(), x0) ....... R1 [B0:L0, B3:L2]
%  p_2(x0,x1) | q_2(x0,x1) ....... B1
%   ~p_2(x0, sk2_0()) | q_2(sk1_0(), x0) ....... R2 [R1:L1, B1:L0]
%   ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%    ~p_2(x0, sk2_0()) | q_2(x0, sk1_0()) ....... R3 [R2:L1, B2:L0]
%    ~q_2(x2,x1) | ~q_2(x0,x2) | q_2(x0,x1) ....... B4
%     ~p_2(x0, sk2_0()) | ~q_2(sk1_0(), x1) | q_2(x0, x1) ....... R4 [R3:L1, B4:L1]
%     q_2(sk1_0(),x0) ....... U11
%      ~p_2(x0, sk2_0()) | q_2(x0, x1) ....... R5 [R4:L1, U11:L0]
%      ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%       ~p_2(x0, sk2_0()) | q_2(x1, x0) ....... R6 [R5:L1, B2:L0]
%       ~q_2(sk3_0(),sk4_0()) ....... U1
%        ~p_2(sk4_0(), sk2_0()) ....... R7 [R6:L1, U1:L0]
% Derivation of unit clause U22:
% p_2(x0,x1) | q_2(x0,x1) ....... B1
% ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%  p_2(x0, x1) | q_2(x1, x0) ....... R1 [B1:L1, B2:L0]
%  ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%   p_2(x0, x1) | q_2(x0, x1) ....... R2 [R1:L1, B2:L0]
%   ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%    p_2(x0, x1) | q_2(x1, x0) ....... R3 [R2:L1, B2:L0]
%    ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%     p_2(x0, x1) | q_2(x0, x1) ....... R4 [R3:L1, B2:L0]
%     ~q_2(x2,x1) | ~q_2(x0,x2) | q_2(x0,x1) ....... B4
%      p_2(x0, x1) | ~q_2(x2, x0) | q_2(x2, x1) ....... R5 [R4:L1, B4:L0]
%      ~p_2(sk1_0(),sk3_0()) ....... U17
%       ~q_2(x0, sk1_0()) | q_2(x0, sk3_0()) ....... R6 [R5:L0, U17:L0]
%       ~q_2(sk4_0(),sk3_0()) ....... U5
%        ~q_2(sk4_0(), sk1_0()) ....... R7 [R6:L1, U5:L0]
% Derivation of unit clause U28:
% p_2(x0,x1) | q_2(x0,x1) ....... B1
% ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%  p_2(x0, x1) | q_2(x1, x0) ....... R1 [B1:L1, B2:L0]
%  ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%   p_2(x0, x1) | q_2(x0, x1) ....... R2 [R1:L1, B2:L0]
%   ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%    p_2(x0, x1) | q_2(x1, x0) ....... R3 [R2:L1, B2:L0]
%    ~q_2(x1,x0) | q_2(x0,x1) ....... B2
%     p_2(x0, x1) | q_2(x0, x1) ....... R4 [R3:L1, B2:L0]
%     ~q_2(x2,x1) | ~q_2(x0,x2) | q_2(x0,x1) ....... B4
%      p_2(x0, x1) | ~q_2(x1, x2) | q_2(x0, x2) ....... R5 [R4:L1, B4:L1]
%      ~p_2(sk4_0(),sk2_0()) ....... U19
%       ~q_2(sk2_0(), x0) | q_2(sk4_0(), x0) ....... R6 [R5:L0, U19:L0]
%       q_2(sk2_0(),sk1_0()) ....... U4
%        q_2(sk4_0(), sk1_0()) ....... R7 [R6:L0, U4:L0]
% Derivation of the empty clause:
% q_2(sk4_0(),sk1_0()) ....... U28
% ~q_2(sk4_0(),sk1_0()) ....... U22
%  [] ....... R1 [U28:L0, U22:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 229980
% 	resolvents: 209149	factors: 20831
% Number of unit clauses generated: 38854
% % unit clauses generated to total clauses generated: 16.89
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2		[1] = 4		[2] = 1		[3] = 4		
% [7] = 18	
% Total = 29
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 38854	[2] = 151786	[3] = 39340	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p_2		(+)7	(-)5
% [1] q_2		(+)13	(-)4
% 			------------------
% 		Total:	(+)20	(-)9
% Total number of unit clauses retained: 29
% Number of clauses skipped because of their length: 111722
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 230025
% Number of unification failures: 227348
% Number of unit to unit unification failures: 85
% N literal unification failure due to lookup root_id table: 261860
% N base clause resolution failure due to lookup table: 40917
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 14
% N unit clauses dropped because they exceeded max values: 32456
% 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: 2
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 20
% Total number of terms of all unit clauses in table: 58
% 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.34
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 457373
% ConstructUnitClause() = 32483
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.04 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.53 secs
% 
%------------------------------------------------------------------------------