TSTP Solution File: GEO002-4 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : GEO002-4 : TPTP v5.0.0. Released v1.1.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 : Sat Nov 27 20:21:42 EST 2010

% Result   : Unsatisfiable 0.15s
% Output   : Refutation 0.15s
% 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/SystemOnTPTP2637/GEO/GEO002-4+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 = 11] [nf = 0] [nu = 2] [ut = 4]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 85] [nf = 6] [nu = 31] [ut = 10]
% Looking for a proof at depth = 3 ...
% 	t = 1 secs [nr = 331] [nf = 82] [nu = 109] [ut = 17]
% Looking for a proof at depth = 4 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~between_3(a_0(),a_0(),b_0())
% B1: between_3(x0,x1,extension_4(x0,x1,x2,x3))
% B2: equidistant_4(x0,extension_4(x1,x0,x2,x3),x2,x3)
% B3: ~equidistant_4(x0,x1,x2,x2) | equalish_2(x0,x1)
% B4: ~between_3(x3,x2,x4) | ~between_3(x0,x1,x2) | between_3(x0,outer_pasch_5(x1,x0,x3,x4,x2),x3)
% B5: ~between_3(x3,x2,x4) | ~between_3(x0,x1,x2) | between_3(x4,x1,outer_pasch_5(x1,x0,x3,x4,x2))
% B7: ~between_3(x1,x3,x2) | ~between_3(x0,x1,x2) | between_3(x0,x1,x3)
% Unit Clauses:
% --------------
% U0: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~between_3(a_0(),a_0(),b_0())
% U1: < d0 v6 dv4 f1 c0 t7 td2 b > between_3(x0,x1,extension_4(x0,x1,x2,x3))
% U3: < d1 v5 dv3 f1 c0 t6 td2 > equalish_2(x0,extension_4(x1,x0,x2,x2))
% U7: < d2 v3 dv1 f0 c0 t3 td1 > between_3(x0,x0,x0)
% U43: < d4 v3 dv2 f0 c0 t3 td1 > between_3(x0,x1,x1)
% U48: < d4 v7 dv3 f1 c0 t8 td2 > between_3(x0,x1,outer_pasch_5(x2,x1,x1,x2,x2))
% U52: < d4 v3 dv2 f0 c0 t3 td1 > between_3(x0,x0,x1)
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% ~between_3(a_0(),a_0(),b_0()) ....... U0
% Derivation of unit clause U1:
% between_3(x0,x1,extension_4(x0,x1,x2,x3)) ....... U1
% Derivation of unit clause U3:
% equidistant_4(x0,extension_4(x1,x0,x2,x3),x2,x3) ....... B2
% ~equidistant_4(x0,x1,x2,x2) | equalish_2(x0,x1) ....... B3
%  equalish_2(x0, extension_4(x1, x0, x2, x2)) ....... R1 [B2:L0, B3:L0]
% Derivation of unit clause U7:
% between_3(x0,x1,extension_4(x0,x1,x2,x3)) ....... B1
% ~between_3(x1,x3,x2) | ~between_3(x0,x1,x2) | between_3(x0,x1,x3) ....... B7
%  ~between_3(x0, x1, extension_4(x1, x2, x3, x4)) | between_3(x0, x1, x2) ....... R1 [B1:L0, B7:L0]
%  between_3(x0,x1,extension_4(x0,x1,x2,x3)) ....... U1
%   between_3(x0, x0, x0) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U43:
% between_3(x0,x1,extension_4(x0,x1,x2,x3)) ....... B1
% ~between_3(x1,x3,x2) | ~between_3(x0,x1,x2) | between_3(x0,x1,x3) ....... B7
%  ~between_3(x0, x1, extension_4(x2, x0, x3, x4)) | between_3(x2, x0, x1) ....... R1 [B1:L0, B7:L1]
%  ~equalish_2(x0,x1) | ~between_3(x2,x3,x0) | between_3(x2,x3,x1) ....... B6
%   between_3(x0, x1, x2) | ~equalish_2(x3, extension_4(x0, x1, x4, x5)) | ~between_3(x1, x2, x3) ....... R2 [R1:L0, B6:L2]
%   equalish_2(x0,extension_4(x1,x0,x2,x2)) ....... U3
%    between_3(x0, x1, x2) | ~between_3(x1, x2, x1) ....... R3 [R2:L1, U3:L0]
%    between_3(x0,x0,x0) ....... U7
%     between_3(x0, x1, x1) ....... R4 [R3:L1, U7:L0]
% Derivation of unit clause U48:
% ~between_3(x3,x2,x4) | ~between_3(x0,x1,x2) | between_3(x0,outer_pasch_5(x1,x0,x3,x4,x2),x3) ....... B4
%  ~between_3(x0, x1, x1) | between_3(x0, outer_pasch_5(x1, x0, x0, x1, x1), x0) ....... R1 [B4:L0, B4:L1]
%  ~between_3(x1,x3,x2) | ~between_3(x0,x1,x2) | between_3(x0,x1,x3) ....... B7
%   ~between_3(x0, x1, x1) | ~between_3(x2, x0, x0) | between_3(x2, x0, outer_pasch_5(x1, x0, x0, x1, x1)) ....... R2 [R1:L1, B7:L0]
%   between_3(x0,x1,x1) ....... U43
%    ~between_3(x0, x1, x1) | between_3(x0, x1, outer_pasch_5(x2, x1, x1, x2, x2)) ....... R3 [R2:L0, U43:L0]
%    between_3(x0,x1,x1) ....... U43
%     between_3(x0, x1, outer_pasch_5(x2, x1, x1, x2, x2)) ....... R4 [R3:L0, U43:L0]
% Derivation of unit clause U52:
% ~between_3(x3,x2,x4) | ~between_3(x0,x1,x2) | between_3(x4,x1,outer_pasch_5(x1,x0,x3,x4,x2)) ....... B5
%  ~between_3(x0, x1, x1) | between_3(x1, x1, outer_pasch_5(x1, x0, x0, x1, x1)) ....... R1 [B5:L0, B5:L1]
%  ~between_3(x1,x3,x2) | ~between_3(x0,x1,x2) | between_3(x0,x1,x3) ....... B7
%   ~between_3(x0, x1, x1) | ~between_3(x1, x2, outer_pasch_5(x1, x0, x0, x1, x1)) | between_3(x1, x1, x2) ....... R2 [R1:L1, B7:L1]
%   between_3(x0,x1,x1) ....... U43
%    ~between_3(x0, x1, outer_pasch_5(x0, x2, x2, x0, x0)) | between_3(x0, x0, x1) ....... R3 [R2:L0, U43:L0]
%    between_3(x0,x1,outer_pasch_5(x2,x1,x1,x2,x2)) ....... U48
%     between_3(x0, x0, x1) ....... R4 [R3:L0, U48:L0]
% Derivation of the empty clause:
% between_3(x0,x0,x1) ....... U52
% ~between_3(a_0(),a_0(),b_0()) ....... U0
%  [] ....... R1 [U52:L0, U0:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 4692
% 	resolvents: 4541	factors: 151
% Number of unit clauses generated: 2986
% % unit clauses generated to total clauses generated: 63.64
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 3		[1] = 1		[2] = 6		[3] = 7		
% [4] = 36	
% Total = 53
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 2986	[2] = 1341	[3] = 365	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] equalish_2		(+)1	(-)13
% [1] between_3		(+)19	(-)14
% [2] equidistant_4	(+)1	(-)5
% 			------------------
% 		Total:	(+)21	(-)32
% Total number of unit clauses retained: 53
% Number of clauses skipped because of their length: 3667
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 4707
% Number of unification failures: 14809
% Number of unit to unit unification failures: 270
% N literal unification failure due to lookup root_id table: 1793
% N base clause resolution failure due to lookup table: 1559
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 15
% N unit clauses dropped because they exceeded max values: 2641
% N unit clauses dropped because too much nesting: 1
% 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: 8
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 212
% Total number of terms of all unit clauses in table: 344
% 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.62
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 19516
% ConstructUnitClause() = 2691
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.15 secs
% 
%------------------------------------------------------------------------------