TSTP Solution File: MSC006-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MSC006-1 : TPTP v5.0.0. Released v1.0.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 02:00:42 EST 2010
% Result : Unsatisfiable 0.61s
% Output : Refutation 0.61s
% 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/SystemOnTPTP25291/MSC/MSC006-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 = 15] [nf = 0] [nu = 10] [ut = 7]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 80] [nf = 8] [nu = 31] [ut = 7]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 589] [nf = 66] [nu = 188] [ut = 11]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 4122] [nf = 422] [nu = 1079] [ut = 11]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 28886] [nf = 3256] [nu = 6269] [ut = 11]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 200439] [nf = 21152] [nu = 38312] [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: ~q_2(c_0(),d_0())
% B1: ~p_2(a_0(),b_0())
% B2: p_2(x0,x1) | q_2(x0,x1)
% B3: ~q_2(x0,x1) | q_2(x1,x0)
% B4: ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2)
% B5: ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c2 t2 td1 b > ~p_2(a_0(),b_0())
% U3: < d1 v0 dv0 f0 c2 t2 td1 > ~q_2(d_0(),c_0())
% U4: < d1 v0 dv0 f0 c2 t2 td1 > q_2(a_0(),b_0())
% U5: < d1 v0 dv0 f0 c2 t2 td1 > p_2(d_0(),c_0())
% U6: < d1 v0 dv0 f0 c2 t2 td1 > q_2(b_0(),a_0())
% U11: < d7 v1 dv1 f0 c1 t2 td1 > p_2(x0,c_0())
% U13: < d7 v1 dv1 f0 c1 t2 td1 > p_2(d_0(),x0)
% U19: < d7 v0 dv0 f0 c2 t2 td1 > ~q_2(a_0(),d_0())
% U21: < d7 v0 dv0 f0 c2 t2 td1 > ~q_2(c_0(),b_0())
% U23: < d7 v0 dv0 f0 c2 t2 td1 > ~q_2(c_0(),a_0())
% U27: < d7 v0 dv0 f0 c2 t2 td1 > q_2(c_0(),b_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% ~p_2(a_0(),b_0()) ....... U1
% Derivation of unit clause U3:
% ~q_2(c_0(),d_0()) ....... B0
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% ~q_2(d_0(), c_0()) ....... R1 [B0:L0, B3:L1]
% Derivation of unit clause U4:
% ~p_2(a_0(),b_0()) ....... B1
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% q_2(a_0(), b_0()) ....... R1 [B1:L0, B2:L0]
% Derivation of unit clause U5:
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(d_0(),c_0()) ....... U3
% p_2(d_0(), c_0()) ....... R1 [B2:L1, U3:L0]
% Derivation of unit clause U6:
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% q_2(a_0(),b_0()) ....... U4
% q_2(b_0(), a_0()) ....... R1 [B3:L0, U4:L0]
% Derivation of unit clause U11:
% ~q_2(c_0(),d_0()) ....... B0
% ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2) ....... B5
% ~q_2(x0, d_0()) | ~q_2(c_0(), x0) ....... R1 [B0:L0, B5:L2]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(c_0(), x0) | p_2(x0, d_0()) ....... R2 [R1:L0, B2:L1]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% p_2(x0, d_0()) | ~q_2(x0, c_0()) ....... R3 [R2:L0, B3:L1]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% p_2(x0, d_0()) | p_2(x0, c_0()) ....... R4 [R3:L1, B2:L1]
% ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2) ....... B4
% p_2(x0, c_0()) | ~p_2(d_0(), x1) | p_2(x0, x1) ....... R5 [R4:L0, B4:L1]
% ~p_2(d_0(), c_0()) | p_2(x0, c_0()) ....... R6 [R5:L0, R5:L2]
% p_2(d_0(),c_0()) ....... U5
% p_2(x0, c_0()) ....... R7 [R6:L0, U5:L0]
% Derivation of unit clause U13:
% ~q_2(c_0(),d_0()) ....... B0
% ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2) ....... B5
% ~q_2(x0, d_0()) | ~q_2(c_0(), x0) ....... R1 [B0:L0, B5:L2]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(x0, d_0()) | p_2(c_0(), x0) ....... R2 [R1:L1, B2:L1]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% p_2(c_0(), x0) | ~q_2(d_0(), x0) ....... R3 [R2:L0, B3:L1]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% p_2(c_0(), x0) | p_2(d_0(), x0) ....... R4 [R3:L1, B2:L1]
% ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2) ....... B4
% p_2(d_0(), x0) | ~p_2(x1, c_0()) | p_2(x1, x0) ....... R5 [R4:L0, B4:L0]
% ~p_2(d_0(), c_0()) | p_2(d_0(), x0) ....... R6 [R5:L0, R5:L2]
% p_2(d_0(),c_0()) ....... U5
% p_2(d_0(), x0) ....... R7 [R6:L0, U5:L0]
% Derivation of unit clause U19:
% ~q_2(c_0(),d_0()) ....... B0
% ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2) ....... B5
% ~q_2(x0, d_0()) | ~q_2(c_0(), x0) ....... R1 [B0:L0, B5:L2]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(x0, d_0()) | p_2(c_0(), x0) ....... R2 [R1:L1, B2:L1]
% ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2) ....... B4
% ~q_2(x0, d_0()) | ~p_2(x1, c_0()) | p_2(x1, x0) ....... R3 [R2:L1, B4:L0]
% p_2(x0,c_0()) ....... U11
% ~q_2(x0, d_0()) | p_2(x1, x0) ....... R4 [R3:L1, U11:L0]
% ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2) ....... B5
% p_2(x0, x1) | ~q_2(x2, d_0()) | ~q_2(x1, x2) ....... R5 [R4:L0, B5:L2]
% ~p_2(a_0(),b_0()) ....... U1
% ~q_2(x0, d_0()) | ~q_2(b_0(), x0) ....... R6 [R5:L0, U1:L0]
% q_2(b_0(),a_0()) ....... U6
% ~q_2(a_0(), d_0()) ....... R7 [R6:L1, U6:L0]
% Derivation of unit clause U21:
% ~q_2(c_0(),d_0()) ....... B0
% ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2) ....... B5
% ~q_2(x0, d_0()) | ~q_2(c_0(), x0) ....... R1 [B0:L0, B5:L2]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% ~q_2(c_0(), x0) | ~q_2(d_0(), x0) ....... R2 [R1:L0, B3:L1]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(c_0(), x0) | p_2(d_0(), x0) ....... R3 [R2:L1, B2:L1]
% ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2) ....... B4
% ~q_2(c_0(), x0) | ~p_2(x1, d_0()) | p_2(x1, x0) ....... R4 [R3:L1, B4:L0]
% ~p_2(a_0(),b_0()) ....... U1
% ~q_2(c_0(), b_0()) | ~p_2(a_0(), d_0()) ....... R5 [R4:L2, U1:L0]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(c_0(), b_0()) | q_2(a_0(), d_0()) ....... R6 [R5:L1, B2:L0]
% ~q_2(a_0(),d_0()) ....... U19
% ~q_2(c_0(), b_0()) ....... R7 [R6:L1, U19:L0]
% Derivation of unit clause U23:
% ~q_2(c_0(),d_0()) ....... B0
% ~q_2(x1,x2) | ~q_2(x0,x1) | q_2(x0,x2) ....... B5
% ~q_2(x0, d_0()) | ~q_2(c_0(), x0) ....... R1 [B0:L0, B5:L2]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% ~q_2(c_0(), x0) | ~q_2(d_0(), x0) ....... R2 [R1:L0, B3:L1]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% ~q_2(c_0(), x0) | ~q_2(x0, d_0()) ....... R3 [R2:L1, B3:L1]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~q_2(c_0(), x0) | p_2(x0, d_0()) ....... R4 [R3:L1, B2:L1]
% ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2) ....... B4
% ~q_2(c_0(), x0) | ~p_2(d_0(), x1) | p_2(x0, x1) ....... R5 [R4:L1, B4:L1]
% p_2(d_0(),x0) ....... U13
% ~q_2(c_0(), x0) | p_2(x0, x1) ....... R6 [R5:L1, U13:L0]
% ~p_2(a_0(),b_0()) ....... U1
% ~q_2(c_0(), a_0()) ....... R7 [R6:L1, U1:L0]
% Derivation of unit clause U27:
% ~p_2(a_0(),b_0()) ....... B1
% ~p_2(x1,x2) | ~p_2(x0,x1) | p_2(x0,x2) ....... B4
% ~p_2(x0, b_0()) | ~p_2(a_0(), x0) ....... R1 [B1:L0, B4:L2]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% ~p_2(a_0(), x0) | q_2(x0, b_0()) ....... R2 [R1:L0, B2:L0]
% p_2(x0,x1) | q_2(x0,x1) ....... B2
% q_2(x0, b_0()) | q_2(a_0(), x0) ....... R3 [R2:L0, B2:L0]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% q_2(a_0(), x0) | q_2(b_0(), x0) ....... R4 [R3:L0, B3:L0]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% q_2(b_0(), x0) | q_2(x0, a_0()) ....... R5 [R4:L0, B3:L0]
% ~q_2(x0,x1) | q_2(x1,x0) ....... B3
% q_2(x0, a_0()) | q_2(x0, b_0()) ....... R6 [R5:L0, B3:L0]
% ~q_2(c_0(),a_0()) ....... U23
% q_2(c_0(), b_0()) ....... R7 [R6:L0, U23:L0]
% Derivation of the empty clause:
% q_2(c_0(),b_0()) ....... U27
% ~q_2(c_0(),b_0()) ....... U21
% [] ....... R1 [U27:L0, U21:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 264200
% resolvents: 238276 factors: 25924
% Number of unit clauses generated: 38817
% % unit clauses generated to total clauses generated: 14.69
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [1] = 5 [3] = 4
% [7] = 17
% Total = 28
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 38817 [2] = 178615 [3] = 46768
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p_2 (+)12 (-)1
% [1] q_2 (+)6 (-)9
% ------------------
% Total: (+)18 (-)10
% Total number of unit clauses retained: 28
% Number of clauses skipped because of their length: 130355
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 264246
% Number of unification failures: 284062
% Number of unit to unit unification failures: 63
% N literal unification failure due to lookup root_id table: 304047
% N base clause resolution failure due to lookup table: 47436
% 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: 32422
% 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: 56
% 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.36
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 548308
% ConstructUnitClause() = 32448
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.04 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.60 secs
%
%------------------------------------------------------------------------------