TSTP Solution File: GRP003-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP003-2 : TPTP v5.0.0. Released v1.0.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:41:07 EST 2010
% Result : Unsatisfiable 0.22s
% Output : Refutation 0.22s
% 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/SystemOnTPTP8737/GRP/GRP003-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 = 10] [nf = 0] [nu = 0] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 144] [nf = 36] [nu = 61] [ut = 26]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~product_3(a_0(),identity_0(),a_0())
% B1: product_3(x0,x1,multiply_2(x0,x1))
% B2: product_3(identity_0(),x0,x0)
% B4: ~equalish_2(x0,x1) | ~product_3(x2,x3,x0) | product_3(x2,x3,x1)
% B5: ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3)
% B6: ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5)
% B7: ~product_3(x2,x3,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x0,x4,x5)
% Unit Clauses:
% --------------
% U1: < d0 v4 dv2 f1 c0 t5 td2 b > product_3(x0,x1,multiply_2(x0,x1))
% U2: < d0 v2 dv1 f0 c1 t3 td1 b > product_3(identity_0(),x0,x0)
% U3: < d0 v2 dv1 f1 c1 t4 td2 b > product_3(inverse_1(x0),x0,identity_0())
% U7: < d2 v2 dv1 f2 c1 t5 td3 > equalish_2(identity_0(),multiply_2(inverse_1(x0),x0))
% U8: < d2 v2 dv1 f1 c1 t4 td2 > equalish_2(multiply_2(identity_0(),x0),x0)
% U12: < d2 v2 dv1 f2 c2 t6 td3 > product_3(identity_0(),identity_0(),multiply_2(inverse_1(x0),x0))
% U13: < d2 v2 dv1 f1 c2 t5 td2 > product_3(identity_0(),multiply_2(identity_0(),x0),x0)
% U27: < d3 v1 dv1 f0 c2 t3 td1 > ~product_3(x0,identity_0(),a_0())
% U197: < d3 v1 dv1 f1 c3 t5 td2 > ~product_3(x0,identity_0(),multiply_2(identity_0(),a_0()))
% U239: < d3 v3 dv2 f3 c2 t8 td3 > ~product_3(x0,multiply_2(inverse_1(x1),x1),multiply_2(identity_0(),a_0()))
% U279: < d3 v4 dv2 f3 c1 t8 td2 > product_3(inverse_1(x0),multiply_2(x0,x1),multiply_2(identity_0(),x1))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% product_3(x0,x1,multiply_2(x0,x1)) ....... U1
% Derivation of unit clause U2:
% product_3(identity_0(),x0,x0) ....... U2
% Derivation of unit clause U3:
% product_3(inverse_1(x0),x0,identity_0()) ....... U3
% Derivation of unit clause U7:
% product_3(x0,x1,multiply_2(x0,x1)) ....... B1
% ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B5
% ~product_3(x0, x1, x2) | equalish_2(x2, multiply_2(x0, x1)) ....... R1 [B1:L0, B5:L0]
% product_3(inverse_1(x0),x0,identity_0()) ....... U3
% equalish_2(identity_0(), multiply_2(inverse_1(x0), x0)) ....... R2 [R1:L0, U3:L0]
% Derivation of unit clause U8:
% product_3(x0,x1,multiply_2(x0,x1)) ....... B1
% ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B5
% ~product_3(x0, x1, x2) | equalish_2(multiply_2(x0, x1), x2) ....... R1 [B1:L0, B5:L1]
% product_3(identity_0(),x0,x0) ....... U2
% equalish_2(multiply_2(identity_0(), x0), x0) ....... R2 [R1:L0, U2:L0]
% Derivation of unit clause U12:
% product_3(identity_0(),x0,x0) ....... B2
% ~equalish_2(x0,x1) | ~product_3(x2,x3,x0) | product_3(x2,x3,x1) ....... B4
% ~equalish_2(x0, x1) | product_3(identity_0(), x0, x1) ....... R1 [B2:L0, B4:L1]
% equalish_2(identity_0(),multiply_2(inverse_1(x0),x0)) ....... U7
% product_3(identity_0(), identity_0(), multiply_2(inverse_1(x0), x0)) ....... R2 [R1:L0, U7:L0]
% Derivation of unit clause U13:
% product_3(identity_0(),x0,x0) ....... B2
% ~equalish_2(x0,x1) | ~product_3(x2,x3,x0) | product_3(x2,x3,x1) ....... B4
% ~equalish_2(x0, x1) | product_3(identity_0(), x0, x1) ....... R1 [B2:L0, B4:L1]
% equalish_2(multiply_2(identity_0(),x0),x0) ....... U8
% product_3(identity_0(), multiply_2(identity_0(), x0), x0) ....... R2 [R1:L0, U8:L0]
% Derivation of unit clause U27:
% ~product_3(a_0(),identity_0(),a_0()) ....... B0
% ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) ....... B6
% ~product_3(x0, x1, a_0()) | ~product_3(x2, identity_0(), x1) | ~product_3(x0, x2, a_0()) ....... R1 [B0:L0, B6:L3]
% ~product_3(x0, x1, a_0()) | ~product_3(x1, identity_0(), x1) ....... R2 [R1:L2, R1:L0]
% product_3(identity_0(),x0,x0) ....... U2
% ~product_3(x0, identity_0(), a_0()) ....... R3 [R2:L1, U2:L0]
% Derivation of unit clause U197:
% product_3(x0,x1,multiply_2(x0,x1)) ....... B1
% ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) ....... B6
% ~product_3(x0, x1, x2) | ~product_3(x3, x4, x1) | product_3(multiply_2(x0, x3), x4, x2) ....... R1 [B1:L0, B6:L2]
% product_3(identity_0(),multiply_2(identity_0(),x0),x0) ....... U13
% ~product_3(x0, x1, multiply_2(identity_0(), x2)) | product_3(multiply_2(identity_0(), x0), x1, x2) ....... R2 [R1:L0, U13:L0]
% ~product_3(x0,identity_0(),a_0()) ....... U27
% ~product_3(x0, identity_0(), multiply_2(identity_0(), a_0())) ....... R3 [R2:L1, U27:L0]
% Derivation of unit clause U239:
% product_3(x0,x1,multiply_2(x0,x1)) ....... B1
% ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) ....... B6
% ~product_3(x0, x1, x2) | ~product_3(x3, x4, x1) | product_3(multiply_2(x0, x3), x4, x2) ....... R1 [B1:L0, B6:L2]
% product_3(identity_0(),identity_0(),multiply_2(inverse_1(x0),x0)) ....... U12
% ~product_3(x0, multiply_2(inverse_1(x1), x1), x2) | product_3(multiply_2(x0, identity_0()), identity_0(), x2) ....... R2 [R1:L1, U12:L0]
% ~product_3(x0,identity_0(),multiply_2(identity_0(),a_0())) ....... U197
% ~product_3(x0, multiply_2(inverse_1(x1), x1), multiply_2(identity_0(), a_0())) ....... R3 [R2:L1, U197:L0]
% Derivation of unit clause U279:
% product_3(x0,x1,multiply_2(x0,x1)) ....... B1
% ~product_3(x2,x3,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x0,x4,x5) ....... B7
% ~product_3(x0, x1, x2) | ~product_3(x3, x0, x4) | product_3(x3, x2, multiply_2(x4, x1)) ....... R1 [B1:L0, B7:L0]
% product_3(x0,x1,multiply_2(x0,x1)) ....... U1
% ~product_3(x0, x1, x2) | product_3(x0, multiply_2(x1, x3), multiply_2(x2, x3)) ....... R2 [R1:L0, U1:L0]
% product_3(inverse_1(x0),x0,identity_0()) ....... U3
% product_3(inverse_1(x0), multiply_2(x0, x1), multiply_2(identity_0(), x1)) ....... R3 [R2:L0, U3:L0]
% Derivation of the empty clause:
% product_3(inverse_1(x0),multiply_2(x0,x1),multiply_2(identity_0(),x1)) ....... U279
% ~product_3(x0,multiply_2(inverse_1(x1),x1),multiply_2(identity_0(),a_0())) ....... U239
% [] ....... R1 [U279:L0, U239:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 22785
% resolvents: 22725 factors: 60
% Number of unit clauses generated: 22107
% % unit clauses generated to total clauses generated: 97.02
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [2] = 22 [3] = 254
% Total = 280
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 22107 [2] = 642 [3] = 36
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] equalish_2 (+)12 (-)1
% [1] product_3 (+)76 (-)191
% ------------------
% Total: (+)88 (-)192
% Total number of unit clauses retained: 280
% Number of clauses skipped because of their length: 1118
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 22805
% Number of unification failures: 49246
% Number of unit to unit unification failures: 14489
% N literal unification failure due to lookup root_id table: 72
% N base clause resolution failure due to lookup table: 5
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 11
% N unit clauses dropped because they exceeded max values: 21782
% N unit clauses dropped because too much nesting: 4776
% 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: 746
% Total number of terms of all unit clauses in table: 1956
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.01
% Ratio n states used/total unit clauses terms: 0.38
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 72051
% ConstructUnitClause() = 22058
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.03 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.21 secs
%
%------------------------------------------------------------------------------