TSTP Solution File: KRS015-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : KRS015-1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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 : Sat Nov 27 22:48:28 EST 2010
% Result : Unsatisfiable 121.01s
% Output : Refutation 121.01s
% 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/SystemOnTPTP25036/KRS/KRS015-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 = 16] [nf = 0] [nu = 2] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 76] [nf = 2] [nu = 12] [ut = 7]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 361] [nf = 9] [nu = 65] [ut = 12]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1283] [nf = 36] [nu = 235] [ut = 12]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 3669] [nf = 79] [nu = 711] [ut = 12]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 9327] [nf = 210] [nu = 1889] [ut = 12]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 22085] [nf = 435] [nu = 4605] [ut = 12]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 50737] [nf = 1116] [nu = 10949] [ut = 12]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 112471] [nf = 2225] [nu = 25391] [ut = 12]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 243409] [nf = 5202] [nu = 56727] [ut = 12]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 515935] [nf = 9975] [nu = 122983] [ut = 12]
% Looking for a proof at depth = 12 ...
% t = 3 secs [nr = 1089767] [nf = 22612] [nu = 264235] [ut = 12]
% Looking for a proof at depth = 13 ...
% t = 6 secs [nr = 2272595] [nf = 42617] [nu = 562083] [ut = 12]
% Looking for a proof at depth = 14 ...
% t = 12 secs [nr = 4721439] [nf = 95094] [nu = 1185769] [ut = 12]
% Looking for a proof at depth = 15 ...
% t = 24 secs [nr = 9720827] [nf = 177751] [nu = 2465115] [ut = 12]
% Looking for a proof at depth = 16 ...
% t = 52 secs [nr = 20101041] [nf = 396448] [nu = 5146001] [ut = 12]
% Looking for a proof at depth = 17 ...
% t = 108 secs [nr = 41273959] [nf = 739385] [nu = 10667095] [ut = 12]
% Looking for a proof at depth = 18 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 124 secs [nr = 47547293] [nf = 949503] [nu = 12857745] [ut = 12]
% Looking for a proof at depth = 2 ...
% t = 124 secs [nr = 47547363] [nf = 949505] [nu = 12857765] [ut = 12]
% Looking for a proof at depth = 3 ...
% t = 124 secs [nr = 47547669] [nf = 949532] [nu = 12857821] [ut = 12]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: e_1(exist_0())
% B1: ~c_1(x0) | t2least_1(x0)
% B2: ~d_1(x0) | t1most_1(x0)
% B3: ~t1most_1(x0) | d_1(x0)
% B5: ~e_1(x0) | r_2(x0,u4r4_1(x0))
% B8: ~t2least_1(x0) | t_2(x0,u1r2_1(x0))
% B9: ~t2least_1(x0) | t_2(x0,u1r1_1(x0))
% B10: ~t2least_1(x0) | ~equalish_2(u1r2_1(x0),u1r1_1(x0))
% B12: ~e_1(x1) | ~r_2(x1,x0) | c_1(x0)
% B13: ~e_1(x1) | ~s_2(x1,x0) | d_1(x0)
% B14: ~e_1(x0) | ~r_2(x0,x1) | s_2(x0,x1)
% B16: ~t1most_1(x2) | ~t_2(x2,x1) | ~t_2(x2,x0) | equalish_2(x0,x1)
% Unit Clauses:
% --------------
% U1: < d1 v0 dv0 f1 c2 t3 td2 > r_2(exist_0(),u4r4_1(exist_0()))
% U2: < d2 v0 dv0 f1 c1 t2 td2 > c_1(u4r4_1(exist_0()))
% U3: < d2 v0 dv0 f1 c2 t3 td2 > s_2(exist_0(),u4r4_1(exist_0()))
% U4: < d2 v0 dv0 f3 c2 t5 td3 > t_2(u4r4_1(exist_0()),u1r2_1(u4r4_1(exist_0())))
% U5: < d2 v0 dv0 f3 c2 t5 td3 > t_2(u4r4_1(exist_0()),u1r1_1(u4r4_1(exist_0())))
% U6: < d2 v0 dv0 f4 c2 t6 td3 > ~equalish_2(u1r2_1(u4r4_1(exist_0())),u1r1_1(u4r4_1(exist_0())))
% U8: < d3 v0 dv0 f1 c1 t2 td2 > t1most_1(u4r4_1(exist_0()))
% U9: < d3 v0 dv0 f1 c1 t2 td2 > d_1(u4r4_1(exist_0()))
% U13: < d4 v0 dv0 f4 c2 t6 td3 > equalish_2(u1r2_1(u4r4_1(exist_0())),u1r1_1(u4r4_1(exist_0())))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% e_1(exist_0()) ....... B0
% ~e_1(x0) | r_2(x0,u4r4_1(x0)) ....... B5
% r_2(exist_0(), u4r4_1(exist_0())) ....... R1 [B0:L0, B5:L0]
% Derivation of unit clause U2:
% e_1(exist_0()) ....... B0
% ~e_1(x1) | ~r_2(x1,x0) | c_1(x0) ....... B12
% ~r_2(exist_0(), x0) | c_1(x0) ....... R1 [B0:L0, B12:L0]
% r_2(exist_0(),u4r4_1(exist_0())) ....... U1
% c_1(u4r4_1(exist_0())) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U3:
% e_1(exist_0()) ....... B0
% ~e_1(x0) | ~r_2(x0,x1) | s_2(x0,x1) ....... B14
% ~r_2(exist_0(), x0) | s_2(exist_0(), x0) ....... R1 [B0:L0, B14:L0]
% r_2(exist_0(),u4r4_1(exist_0())) ....... U1
% s_2(exist_0(), u4r4_1(exist_0())) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U4:
% ~c_1(x0) | t2least_1(x0) ....... B1
% ~t2least_1(x0) | t_2(x0,u1r2_1(x0)) ....... B8
% ~c_1(x0) | t_2(x0, u1r2_1(x0)) ....... R1 [B1:L1, B8:L0]
% c_1(u4r4_1(exist_0())) ....... U2
% t_2(u4r4_1(exist_0()), u1r2_1(u4r4_1(exist_0()))) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U5:
% ~c_1(x0) | t2least_1(x0) ....... B1
% ~t2least_1(x0) | t_2(x0,u1r1_1(x0)) ....... B9
% ~c_1(x0) | t_2(x0, u1r1_1(x0)) ....... R1 [B1:L1, B9:L0]
% c_1(u4r4_1(exist_0())) ....... U2
% t_2(u4r4_1(exist_0()), u1r1_1(u4r4_1(exist_0()))) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U6:
% ~c_1(x0) | t2least_1(x0) ....... B1
% ~t2least_1(x0) | ~equalish_2(u1r2_1(x0),u1r1_1(x0)) ....... B10
% ~c_1(x0) | ~equalish_2(u1r2_1(x0), u1r1_1(x0)) ....... R1 [B1:L1, B10:L0]
% c_1(u4r4_1(exist_0())) ....... U2
% ~equalish_2(u1r2_1(u4r4_1(exist_0())), u1r1_1(u4r4_1(exist_0()))) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U8:
% e_1(exist_0()) ....... B0
% ~e_1(x1) | ~s_2(x1,x0) | d_1(x0) ....... B13
% ~s_2(exist_0(), x0) | d_1(x0) ....... R1 [B0:L0, B13:L0]
% ~d_1(x0) | t1most_1(x0) ....... B2
% ~s_2(exist_0(), x0) | t1most_1(x0) ....... R2 [R1:L1, B2:L0]
% s_2(exist_0(),u4r4_1(exist_0())) ....... U3
% t1most_1(u4r4_1(exist_0())) ....... R3 [R2:L0, U3:L0]
% Derivation of unit clause U9:
% ~d_1(x0) | t1most_1(x0) ....... B2
% ~t1most_1(x0) | d_1(x0) ....... B3
% ~d_1(x0) | d_1(x0) ....... R1 [B2:L1, B3:L0]
% ~t1most_1(x0) | d_1(x0) ....... B3
% d_1(x0) | ~t1most_1(x0) ....... R2 [R1:L0, B3:L1]
% t1most_1(u4r4_1(exist_0())) ....... U8
% d_1(u4r4_1(exist_0())) ....... R3 [R2:L1, U8:L0]
% Derivation of unit clause U13:
% ~d_1(x0) | t1most_1(x0) ....... B2
% ~t1most_1(x2) | ~t_2(x2,x1) | ~t_2(x2,x0) | equalish_2(x0,x1) ....... B16
% ~d_1(x0) | ~t_2(x0, x1) | ~t_2(x0, x2) | equalish_2(x2, x1) ....... R1 [B2:L1, B16:L0]
% d_1(u4r4_1(exist_0())) ....... U9
% ~t_2(u4r4_1(exist_0()), x0) | ~t_2(u4r4_1(exist_0()), x1) | equalish_2(x1, x0) ....... R2 [R1:L0, U9:L0]
% t_2(u4r4_1(exist_0()),u1r1_1(u4r4_1(exist_0()))) ....... U5
% ~t_2(u4r4_1(exist_0()), x0) | equalish_2(x0, u1r1_1(u4r4_1(exist_0()))) ....... R3 [R2:L0, U5:L0]
% t_2(u4r4_1(exist_0()),u1r2_1(u4r4_1(exist_0()))) ....... U4
% equalish_2(u1r2_1(u4r4_1(exist_0())), u1r1_1(u4r4_1(exist_0()))) ....... R4 [R3:L0, U4:L0]
% Derivation of the empty clause:
% equalish_2(u1r2_1(u4r4_1(exist_0())),u1r1_1(u4r4_1(exist_0()))) ....... U13
% ~equalish_2(u1r2_1(u4r4_1(exist_0())),u1r1_1(u4r4_1(exist_0()))) ....... U6
% [] ....... R1 [U13:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 48497701
% resolvents: 47548150 factors: 949551
% Number of unit clauses generated: 12857953
% % unit clauses generated to total clauses generated: 26.51
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [1] = 1 [2] = 5 [3] = 5
% [4] = 2
% Total = 14
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 12857953 [2] = 25497875 [3] = 10141830 [4] = 35 [5] = 8
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_1 (+)1 (-)0
% [1] d_1 (+)1 (-)0
% [2] e_1 (+)1 (-)0
% [3] t1most_1 (+)1 (-)0
% [4] t2least_1 (+)1 (-)0
% [5] equalish_2 (+)4 (-)1
% [6] r_2 (+)1 (-)0
% [7] s_2 (+)1 (-)0
% [8] t_2 (+)2 (-)0
% ------------------
% Total: (+)13 (-)1
% Total number of unit clauses retained: 14
% Number of clauses skipped because of their length: 37584636
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 150
% Number of successful unifications: 48497722
% Number of unification failures: 27137139
% Number of unit to unit unification failures: 3
% N literal unification failure due to lookup root_id table: 203102819
% N base clause resolution failure due to lookup table: 440258242
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 19
% N unit clauses dropped because they exceeded max values: 6598321
% 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: 6
% Max term depth in a unit clause: 3
% Number of states in UCFA table: 46
% Total number of terms of all unit clauses in table: 55
% 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.84
% Number of symbols (columns) in UCFA: 52
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 75634861
% ConstructUnitClause() = 6598334
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 7.77 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 400807
% | |
% --------------------------------------------------------
% Elapsed time: 124 secs
% CPU time: 121.00 secs
%
%------------------------------------------------------------------------------