TSTP Solution File: SYN005-1.010 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN005-1.010 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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:21:50 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/SystemOnTPTP30564/SYN/SYN005-1.010+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 = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 10] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 20] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 30] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 40] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 50] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 60] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 70] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 80] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 90] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 100] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 110] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 120] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 130] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 140] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 150] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 160] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 170] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 180] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 190] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 200] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 210] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 220] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 229] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 9 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: p_1_2(a_0(),a_0())
% B9: ~p_10_2(x9,x0) | ~p_1_2(x0,x1) | ~p_2_2(x1,x2) | ~p_3_2(x2,x3) | ~p_4_2(x3,x4) | ~p_5_2(x4,x5) | ~p_6_2(x5,x6) | ~p_7_2(x6,x7) | ~p_8_2(x7,x8) | ~p_9_2(x8,x9)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_2_2(a_0(),a_0())
% U2: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_3_2(a_0(),a_0())
% U3: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_4_2(a_0(),a_0())
% U4: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_5_2(a_0(),a_0())
% U5: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_6_2(a_0(),a_0())
% U6: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_7_2(a_0(),a_0())
% U7: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_8_2(a_0(),a_0())
% U8: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_9_2(a_0(),a_0())
% U9: < d0 v0 dv0 f0 c2 t2 td1 b nc > p_10_2(a_0(),a_0())
% U10: < d9 v0 dv0 f0 c2 t2 td1 > ~p_9_2(a_0(),a_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% p_2_2(a_0(),a_0()) ....... U1
% Derivation of unit clause U2:
% p_3_2(a_0(),a_0()) ....... U2
% Derivation of unit clause U3:
% p_4_2(a_0(),a_0()) ....... U3
% Derivation of unit clause U4:
% p_5_2(a_0(),a_0()) ....... U4
% Derivation of unit clause U5:
% p_6_2(a_0(),a_0()) ....... U5
% Derivation of unit clause U6:
% p_7_2(a_0(),a_0()) ....... U6
% Derivation of unit clause U7:
% p_8_2(a_0(),a_0()) ....... U7
% Derivation of unit clause U8:
% p_9_2(a_0(),a_0()) ....... U8
% Derivation of unit clause U9:
% p_10_2(a_0(),a_0()) ....... U9
% Derivation of unit clause U10:
% p_1_2(a_0(),a_0()) ....... B0
% ~p_10_2(x9,x0) | ~p_1_2(x0,x1) | ~p_2_2(x1,x2) | ~p_3_2(x2,x3) | ~p_4_2(x3,x4) | ~p_5_2(x4,x5) | ~p_6_2(x5,x6) | ~p_7_2(x6,x7) | ~p_8_2(x7,x8) | ~p_9_2(x8,x9) ....... B9
% ~p_10_2(x0, a_0()) | ~p_2_2(a_0(), x1) | ~p_3_2(x1, x2) | ~p_4_2(x2, x3) | ~p_5_2(x3, x4) | ~p_6_2(x4, x5) | ~p_7_2(x5, x6) | ~p_8_2(x6, x7) | ~p_9_2(x7, x0) ....... R1 [B0:L0, B9:L1]
% p_10_2(a_0(),a_0()) ....... U9
% ~p_2_2(a_0(), x0) | ~p_3_2(x0, x1) | ~p_4_2(x1, x2) | ~p_5_2(x2, x3) | ~p_6_2(x3, x4) | ~p_7_2(x4, x5) | ~p_8_2(x5, x6) | ~p_9_2(x6, a_0()) ....... R2 [R1:L0, U9:L0]
% p_2_2(a_0(),a_0()) ....... U1
% ~p_3_2(a_0(), x0) | ~p_4_2(x0, x1) | ~p_5_2(x1, x2) | ~p_6_2(x2, x3) | ~p_7_2(x3, x4) | ~p_8_2(x4, x5) | ~p_9_2(x5, a_0()) ....... R3 [R2:L0, U1:L0]
% p_3_2(a_0(),a_0()) ....... U2
% ~p_4_2(a_0(), x0) | ~p_5_2(x0, x1) | ~p_6_2(x1, x2) | ~p_7_2(x2, x3) | ~p_8_2(x3, x4) | ~p_9_2(x4, a_0()) ....... R4 [R3:L0, U2:L0]
% p_4_2(a_0(),a_0()) ....... U3
% ~p_5_2(a_0(), x0) | ~p_6_2(x0, x1) | ~p_7_2(x1, x2) | ~p_8_2(x2, x3) | ~p_9_2(x3, a_0()) ....... R5 [R4:L0, U3:L0]
% p_5_2(a_0(),a_0()) ....... U4
% ~p_6_2(a_0(), x0) | ~p_7_2(x0, x1) | ~p_8_2(x1, x2) | ~p_9_2(x2, a_0()) ....... R6 [R5:L0, U4:L0]
% p_6_2(a_0(),a_0()) ....... U5
% ~p_7_2(a_0(), x0) | ~p_8_2(x0, x1) | ~p_9_2(x1, a_0()) ....... R7 [R6:L0, U5:L0]
% p_7_2(a_0(),a_0()) ....... U6
% ~p_8_2(a_0(), x0) | ~p_9_2(x0, a_0()) ....... R8 [R7:L0, U6:L0]
% p_8_2(a_0(),a_0()) ....... U7
% ~p_9_2(a_0(), a_0()) ....... R9 [R8:L0, U7:L0]
% Derivation of the empty clause:
% ~p_9_2(a_0(),a_0()) ....... U10
% p_9_2(a_0(),a_0()) ....... U8
% [] ....... R1 [U10:L0, U8:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 238
% resolvents: 238 factors: 0
% Number of unit clauses generated: 1
% % unit clauses generated to total clauses generated: 0.42
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 10 [9] = 1
% Total = 11
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1 [2] = 1 [3] = 1 [4] = 1 [5] = 1 [6] = 1
% [7] = 1 [8] = 1 [9] = 230
% Average size of a generated clause: 9.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p_10_2 (+)1 (-)0
% [1] p_1_2 (+)1 (-)0
% [2] p_2_2 (+)1 (-)0
% [3] p_3_2 (+)1 (-)0
% [4] p_4_2 (+)1 (-)0
% [5] p_5_2 (+)1 (-)0
% [6] p_6_2 (+)1 (-)0
% [7] p_7_2 (+)1 (-)0
% [8] p_8_2 (+)1 (-)0
% [9] p_9_2 (+)1 (-)1
% ------------------
% Total: (+)10 (-)1
% Total number of unit clauses retained: 11
% Number of clauses skipped because of their length: 72
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 247
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 82
% N base clause resolution failure due to lookup table: 0
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 2
% N unit clauses dropped because they exceeded max values: 0
% 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: 25
% Total number of terms of all unit clauses in table: 22
% 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.14
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 247
% ConstructUnitClause() = 1
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.14 secs
%
%------------------------------------------------------------------------------