TSTP Solution File: GRP125-1.003 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : GRP125-1.003 : TPTP v5.0.0. Released v1.2.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 : Sat Nov 27 21:03:27 EST 2010
% Result : Unsatisfiable 31.01s
% Output : Refutation 31.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/SystemOnTPTP7258/GRP/GRP125-1.003+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 = 1 secs [nr = 24] [nf = 0] [nu = 0] [ut = 10]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 160] [nf = 8] [nu = 86] [ut = 29]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 392] [nf = 156] [nu = 184] [ut = 29]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 1712] [nf = 304] [nu = 1010] [ut = 29]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 4088] [nf = 2740] [nu = 1836] [ut = 29]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 16384] [nf = 5176] [nu = 9078] [ut = 29]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 40968] [nf = 31740] [nu = 16320] [ut = 29]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 155944] [nf = 58304] [nu = 81482] [ut = 29]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 391736] [nf = 329988] [nu = 146644] [ut = 29]
% Looking for a proof at depth = 10 ...
% t = 5 secs [nr = 1473848] [nf = 601672] [nu = 757406] [ut = 29]
% Looking for a proof at depth = 11 ...
% t = 12 secs [nr = 3726104] [nf = 3174604] [nu = 1368168] [ut = 29]
% Looking for a proof at depth = 12 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 32 secs [nr = 10836147] [nf = 4656896] [nu = 5471386] [ut = 29]
% Looking for a proof at depth = 2 ...
% t = 32 secs [nr = 10836313] [nf = 4656904] [nu = 5471484] [ut = 29]
% Looking for a proof at depth = 3 ...
% t = 32 secs [nr = 10836561] [nf = 4657076] [nu = 5471582] [ut = 29]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~product_3(x1,x0,x3) | ~product_3(x0,x1,x2) | product_3(x2,x3,x0)
% B1: product_3(x0,x0,x0)
% B3: group_element_1(e_2_0())
% B5: ~equalish_2(e_1_0(),e_2_0())
% B11: ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3)
% B12: ~product_3(x0,x3,x2) | ~product_3(x0,x1,x2) | equalish_2(x1,x3)
% B13: ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3)
% B14: ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) | product_3(x0,x1,e_3_0())
% Unit Clauses:
% --------------
% U0: < d0 v3 dv1 f0 c0 t3 td1 b > product_3(x0,x0,x0)
% U3: < d0 v0 dv0 f0 c1 t1 td1 b > group_element_1(e_3_0())
% U7: < d0 v0 dv0 f0 c2 t2 td1 b > ~equalish_2(e_2_0(),e_3_0())
% U9: < d0 v0 dv0 f0 c2 t2 td1 b > ~equalish_2(e_3_0(),e_2_0())
% U20: < d2 v0 dv0 f0 c3 t3 td1 > ~product_3(e_3_0(),e_2_0(),e_3_0())
% U22: < d2 v0 dv0 f0 c3 t3 td1 > ~product_3(e_2_0(),e_3_0(),e_2_0())
% U26: < d2 v0 dv0 f0 c3 t3 td1 > ~product_3(e_2_0(),e_3_0(),e_3_0())
% U28: < d2 v0 dv0 f0 c3 t3 td1 > ~product_3(e_3_0(),e_2_0(),e_2_0())
% U35: < d4 v0 dv0 f0 c3 t3 td1 > product_3(e_3_0(),e_2_0(),e_1_0())
% U36: < d4 v0 dv0 f0 c3 t3 td1 > product_3(e_2_0(),e_3_0(),e_1_0())
% U38: < d4 v0 dv0 f0 c3 t3 td1 > ~product_3(e_2_0(),e_3_0(),e_1_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% product_3(x0,x0,x0) ....... U0
% Derivation of unit clause U3:
% group_element_1(e_3_0()) ....... U3
% Derivation of unit clause U7:
% ~equalish_2(e_2_0(),e_3_0()) ....... U7
% Derivation of unit clause U9:
% ~equalish_2(e_3_0(),e_2_0()) ....... U9
% Derivation of unit clause U20:
% product_3(x0,x0,x0) ....... B1
% ~product_3(x0,x3,x2) | ~product_3(x0,x1,x2) | equalish_2(x1,x3) ....... B12
% ~product_3(x0, x1, x0) | equalish_2(x1, x0) ....... R1 [B1:L0, B12:L0]
% ~equalish_2(e_2_0(),e_3_0()) ....... U7
% ~product_3(e_3_0(), e_2_0(), e_3_0()) ....... R2 [R1:L1, U7:L0]
% Derivation of unit clause U22:
% product_3(x0,x0,x0) ....... B1
% ~product_3(x0,x3,x2) | ~product_3(x0,x1,x2) | equalish_2(x1,x3) ....... B12
% ~product_3(x0, x1, x0) | equalish_2(x1, x0) ....... R1 [B1:L0, B12:L0]
% ~equalish_2(e_3_0(),e_2_0()) ....... U9
% ~product_3(e_2_0(), e_3_0(), e_2_0()) ....... R2 [R1:L1, U9:L0]
% Derivation of unit clause U26:
% product_3(x0,x0,x0) ....... B1
% ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3) ....... B13
% ~product_3(x0, x1, x1) | equalish_2(x0, x1) ....... R1 [B1:L0, B13:L0]
% ~equalish_2(e_2_0(),e_3_0()) ....... U7
% ~product_3(e_2_0(), e_3_0(), e_3_0()) ....... R2 [R1:L1, U7:L0]
% Derivation of unit clause U28:
% product_3(x0,x0,x0) ....... B1
% ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3) ....... B13
% ~product_3(x0, x1, x1) | equalish_2(x0, x1) ....... R1 [B1:L0, B13:L0]
% ~equalish_2(e_3_0(),e_2_0()) ....... U9
% ~product_3(e_3_0(), e_2_0(), e_2_0()) ....... R2 [R1:L1, U9:L0]
% Derivation of unit clause U35:
% group_element_1(e_2_0()) ....... B3
% ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) | product_3(x0,x1,e_3_0()) ....... B14
% ~group_element_1(x0) | product_3(x0, e_2_0(), e_1_0()) | product_3(x0, e_2_0(), e_2_0()) | product_3(x0, e_2_0(), e_3_0()) ....... R1 [B3:L0, B14:L0]
% group_element_1(e_3_0()) ....... U3
% product_3(e_3_0(), e_2_0(), e_1_0()) | product_3(e_3_0(), e_2_0(), e_2_0()) | product_3(e_3_0(), e_2_0(), e_3_0()) ....... R2 [R1:L0, U3:L0]
% ~product_3(e_3_0(),e_2_0(),e_2_0()) ....... U28
% product_3(e_3_0(), e_2_0(), e_1_0()) | product_3(e_3_0(), e_2_0(), e_3_0()) ....... R3 [R2:L1, U28:L0]
% ~product_3(e_3_0(),e_2_0(),e_3_0()) ....... U20
% product_3(e_3_0(), e_2_0(), e_1_0()) ....... R4 [R3:L1, U20:L0]
% Derivation of unit clause U36:
% group_element_1(e_2_0()) ....... B3
% ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) | product_3(x0,x1,e_3_0()) ....... B14
% ~group_element_1(x0) | product_3(e_2_0(), x0, e_1_0()) | product_3(e_2_0(), x0, e_2_0()) | product_3(e_2_0(), x0, e_3_0()) ....... R1 [B3:L0, B14:L1]
% group_element_1(e_3_0()) ....... U3
% product_3(e_2_0(), e_3_0(), e_1_0()) | product_3(e_2_0(), e_3_0(), e_2_0()) | product_3(e_2_0(), e_3_0(), e_3_0()) ....... R2 [R1:L0, U3:L0]
% ~product_3(e_2_0(),e_3_0(),e_2_0()) ....... U22
% product_3(e_2_0(), e_3_0(), e_1_0()) | product_3(e_2_0(), e_3_0(), e_3_0()) ....... R3 [R2:L1, U22:L0]
% ~product_3(e_2_0(),e_3_0(),e_3_0()) ....... U26
% product_3(e_2_0(), e_3_0(), e_1_0()) ....... R4 [R3:L1, U26:L0]
% Derivation of unit clause U38:
% ~equalish_2(e_1_0(),e_2_0()) ....... B5
% ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B11
% ~product_3(x0, x1, e_2_0()) | ~product_3(x0, x1, e_1_0()) ....... R1 [B5:L0, B11:L2]
% ~product_3(x1,x0,x3) | ~product_3(x0,x1,x2) | product_3(x2,x3,x0) ....... B0
% ~product_3(x0, x1, e_1_0()) | ~product_3(x2, e_2_0(), x1) | ~product_3(e_2_0(), x2, x0) ....... R2 [R1:L0, B0:L2]
% product_3(x0,x0,x0) ....... U0
% ~product_3(x0, e_2_0(), e_1_0()) | ~product_3(e_2_0(), x0, e_1_0()) ....... R3 [R2:L0, U0:L0]
% product_3(e_3_0(),e_2_0(),e_1_0()) ....... U35
% ~product_3(e_2_0(), e_3_0(), e_1_0()) ....... R4 [R3:L0, U35:L0]
% Derivation of the empty clause:
% ~product_3(e_2_0(),e_3_0(),e_1_0()) ....... U38
% product_3(e_2_0(),e_3_0(),e_1_0()) ....... U36
% [] ....... R1 [U38:L0, U36:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 15496415
% resolvents: 10839279 factors: 4657136
% Number of unit clauses generated: 5472983
% % unit clauses generated to total clauses generated: 35.32
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 10 [2] = 19 [4] = 10
% Total = 39
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 5472983 [2] = 7649272 [3] = 2374096 [4] = 64
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] group_element_1 (+)3 (-)0
% [1] equalish_2 (+)1 (-)6
% [2] product_3 (+)10 (-)19
% ------------------
% Total: (+)14 (-)25
% Total number of unit clauses retained: 39
% Number of clauses skipped because of their length: 17216171
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 15496435
% Number of unification failures: 17605754
% Number of unit to unit unification failures: 194
% N literal unification failure due to lookup root_id table: 19799272
% N base clause resolution failure due to lookup table: 1230746
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 29
% N unit clauses dropped because they exceeded max values: 4318675
% 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: 3
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 38
% Total number of terms of all unit clauses in table: 104
% 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.37
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 33102189
% ConstructUnitClause() = 4318704
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 4.95 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 499884
% | |
% --------------------------------------------------------
% Elapsed time: 32 secs
% CPU time: 31.00 secs
%
%------------------------------------------------------------------------------