TSTP Solution File: RNG039-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : RNG039-2 : 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 04:32:31 EST 2010
% Result : Unsatisfiable 1.71s
% Output : Refutation 1.71s
% 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/SystemOnTPTP11860/RNG/RNG039-2+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 = 470] [nf = 0] [nu = 152] [ut = 74]
% Looking for a proof at depth = 2 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: product_3(a_0(),b_0(),c_0())
% B2: ~equalish_2(c_0(),d_0())
% B3: product_3(x0,x1,multiply_2(x0,x1))
% B4: sum_3(x0,x1,add_2(x0,x1))
% B5: sum_3(x0,x1,add_2(x1,x0))
% B10: product_3(a_0(),multiply_2(b_0(),x0),multiply_2(x1,x0))
% B11: product_3(x0,x0,x0)
% B13: product_3(additive_identity_0(),x0,additive_identity_0())
% B46: equalish_2(multiply_2(x0,x0),x0)
% B55: ~equalish_2(x0,x1) | ~product_3(x0,x2,x3) | product_3(x1,x2,x3)
% B57: ~equalish_2(x0,x1) | ~product_3(x2,x3,x0) | product_3(x2,x3,x1)
% B58: ~equalish_2(x0,x1) | ~sum_3(x0,x2,x3) | sum_3(x1,x2,x3)
% B60: ~equalish_2(x0,x1) | ~sum_3(x2,x3,x0) | sum_3(x2,x3,x1)
% B61: ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3)
% B63: ~sum_3(x0,x3,x2) | ~sum_3(x0,x1,x2) | equalish_2(x3,x1)
% Unit Clauses:
% --------------
% U13: < d0 v1 dv1 f0 c2 t3 td1 b > product_3(additive_identity_0(),x0,additive_identity_0())
% U14: < d0 v2 dv1 f0 c1 t3 td1 b > sum_3(x0,x0,additive_identity_0())
% U113: < d2 v0 dv0 f0 c3 t3 td1 > ~sum_3(c_0(),d_0(),additive_identity_0())
% U248: < d2 v1 dv1 f1 c2 t4 td2 > equalish_2(multiply_2(additive_identity_0(),x0),additive_identity_0())
% U348: < d2 v0 dv0 f1 c3 t4 td2 > ~equalish_2(add_2(c_0(),d_0()),additive_identity_0())
% U440: < d2 v2 dv1 f2 c3 t7 td2 > ~sum_3(x0,add_2(c_0(),d_0()),add_2(x0,additive_identity_0()))
% U503: < d2 v0 dv0 f1 c3 t4 td2 > ~equalish_2(additive_identity_0(),add_2(c_0(),d_0()))
% U2270: < d2 v1 dv1 f1 c3 t5 td2 > product_3(a_0(),multiply_2(b_0(),x0),additive_identity_0())
% U2316: < d2 v2 dv2 f1 c1 t4 td2 > equalish_2(additive_identity_0(),multiply_2(x0,x1))
% U2634: < d2 v0 dv0 f2 c5 t7 td2 > ~product_3(add_2(c_0(),d_0()),add_2(c_0(),d_0()),additive_identity_0())
% U2971: < d2 v3 dv3 f1 c1 t5 td2 > product_3(multiply_2(x0,x1),x2,additive_identity_0())
% U8882: < d2 v2 dv2 f0 c1 t3 td1 > product_3(x0,x1,additive_identity_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U13:
% product_3(additive_identity_0(),x0,additive_identity_0()) ....... U13
% Derivation of unit clause U14:
% sum_3(x0,x0,additive_identity_0()) ....... U14
% Derivation of unit clause U113:
% ~equalish_2(c_0(),d_0()) ....... B2
% ~sum_3(x0,x3,x2) | ~sum_3(x0,x1,x2) | equalish_2(x3,x1) ....... B63
% ~sum_3(x0, c_0(), x1) | ~sum_3(x0, d_0(), x1) ....... R1 [B2:L0, B63:L2]
% sum_3(x0,x0,additive_identity_0()) ....... U14
% ~sum_3(c_0(), d_0(), additive_identity_0()) ....... R2 [R1:L0, U14:L0]
% Derivation of unit clause U248:
% product_3(x0,x1,multiply_2(x0,x1)) ....... B3
% ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B61
% ~product_3(x0, x1, x2) | equalish_2(multiply_2(x0, x1), x2) ....... R1 [B3:L0, B61:L1]
% product_3(additive_identity_0(),x0,additive_identity_0()) ....... U13
% equalish_2(multiply_2(additive_identity_0(), x0), additive_identity_0()) ....... R2 [R1:L0, U13:L0]
% Derivation of unit clause U348:
% sum_3(x0,x1,add_2(x0,x1)) ....... B4
% ~equalish_2(x0,x1) | ~sum_3(x2,x3,x0) | sum_3(x2,x3,x1) ....... B60
% ~equalish_2(add_2(x0, x1), x2) | sum_3(x0, x1, x2) ....... R1 [B4:L0, B60:L1]
% ~sum_3(c_0(),d_0(),additive_identity_0()) ....... U113
% ~equalish_2(add_2(c_0(), d_0()), additive_identity_0()) ....... R2 [R1:L1, U113:L0]
% Derivation of unit clause U440:
% sum_3(x0,x1,add_2(x0,x1)) ....... B4
% ~sum_3(x0,x3,x2) | ~sum_3(x0,x1,x2) | equalish_2(x3,x1) ....... B63
% ~sum_3(x0, x1, add_2(x0, x2)) | equalish_2(x1, x2) ....... R1 [B4:L0, B63:L1]
% ~equalish_2(add_2(c_0(),d_0()),additive_identity_0()) ....... U348
% ~sum_3(x0, add_2(c_0(), d_0()), add_2(x0, additive_identity_0())) ....... R2 [R1:L1, U348:L0]
% Derivation of unit clause U503:
% sum_3(x0,x1,add_2(x1,x0)) ....... B5
% ~equalish_2(x0,x1) | ~sum_3(x0,x2,x3) | sum_3(x1,x2,x3) ....... B58
% ~equalish_2(x0, x1) | sum_3(x1, x2, add_2(x2, x0)) ....... R1 [B5:L0, B58:L1]
% ~sum_3(x0,add_2(c_0(),d_0()),add_2(x0,additive_identity_0())) ....... U440
% ~equalish_2(additive_identity_0(), add_2(c_0(), d_0())) ....... R2 [R1:L1, U440:L0]
% Derivation of unit clause U2270:
% product_3(a_0(),multiply_2(b_0(),x0),multiply_2(x1,x0)) ....... B10
% ~equalish_2(x0,x1) | ~product_3(x2,x3,x0) | product_3(x2,x3,x1) ....... B57
% ~equalish_2(multiply_2(x0, x1), x2) | product_3(a_0(), multiply_2(b_0(), x1), x2) ....... R1 [B10:L0, B57:L1]
% equalish_2(multiply_2(additive_identity_0(),x0),additive_identity_0()) ....... U248
% product_3(a_0(), multiply_2(b_0(), x0), additive_identity_0()) ....... R2 [R1:L0, U248:L0]
% Derivation of unit clause U2316:
% product_3(a_0(),multiply_2(b_0(),x0),multiply_2(x1,x0)) ....... B10
% ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B61
% ~product_3(a_0(), multiply_2(b_0(), x0), x1) | equalish_2(x1, multiply_2(x2, x0)) ....... R1 [B10:L0, B61:L0]
% product_3(a_0(),multiply_2(b_0(),x0),additive_identity_0()) ....... U2270
% equalish_2(additive_identity_0(), multiply_2(x0, x1)) ....... R2 [R1:L0, U2270:L0]
% Derivation of unit clause U2634:
% product_3(x0,x0,x0) ....... B11
% ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B61
% ~product_3(x0, x0, x1) | equalish_2(x1, x0) ....... R1 [B11:L0, B61:L0]
% ~equalish_2(additive_identity_0(),add_2(c_0(),d_0())) ....... U503
% ~product_3(add_2(c_0(), d_0()), add_2(c_0(), d_0()), additive_identity_0()) ....... R2 [R1:L1, U503:L0]
% Derivation of unit clause U2971:
% product_3(additive_identity_0(),x0,additive_identity_0()) ....... B13
% ~equalish_2(x0,x1) | ~product_3(x0,x2,x3) | product_3(x1,x2,x3) ....... B55
% ~equalish_2(additive_identity_0(), x0) | product_3(x0, x1, additive_identity_0()) ....... R1 [B13:L0, B55:L1]
% equalish_2(additive_identity_0(),multiply_2(x0,x1)) ....... U2316
% product_3(multiply_2(x0, x1), x2, additive_identity_0()) ....... R2 [R1:L0, U2316:L0]
% Derivation of unit clause U8882:
% equalish_2(multiply_2(x0,x0),x0) ....... B46
% ~equalish_2(x0,x1) | ~product_3(x0,x2,x3) | product_3(x1,x2,x3) ....... B55
% ~product_3(multiply_2(x0, x0), x1, x2) | product_3(x0, x1, x2) ....... R1 [B46:L0, B55:L0]
% product_3(multiply_2(x0,x1),x2,additive_identity_0()) ....... U2971
% product_3(x0, x1, additive_identity_0()) ....... R2 [R1:L0, U2971:L0]
% Derivation of the empty clause:
% product_3(x0,x1,additive_identity_0()) ....... U8882
% ~product_3(add_2(c_0(),d_0()),add_2(c_0(),d_0()),additive_identity_0()) ....... U2634
% [] ....... R1 [U8882:L0, U2634:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 86830
% resolvents: 86580 factors: 250
% Number of unit clauses generated: 85000
% % unit clauses generated to total clauses generated: 97.89
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 50 [1] = 24 [2] = 8809
% Total = 8883
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 85000 [2] = 1572 [3] = 258
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] equalish_2 (+)2134 (-)753
% [1] product_3 (+)2428 (-)400
% [2] sum_3 (+)2028 (-)1140
% ------------------
% Total: (+)6590 (-)2293
% Total number of unit clauses retained: 8883
% Number of clauses skipped because of their length: 3417
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 86850
% Number of unification failures: 338535
% Number of unit to unit unification failures: 4889705
% N literal unification failure due to lookup root_id table: 4335
% N base clause resolution failure due to lookup table: 1347
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 7
% N unit clauses dropped because they exceeded max values: 76148
% N unit clauses dropped because too much nesting: 1600
% 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: 4
% Number of states in UCFA table: 15273
% Total number of terms of all unit clauses in table: 59724
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.19
% Ratio n states used/total unit clauses terms: 0.26
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 425385
% ConstructUnitClause() = 84981
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.13 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 86830
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 1.70 secs
%
%------------------------------------------------------------------------------