TSTP Solution File: MGT018-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MGT018-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 01:53:57 EST 2010
% Result : Unsatisfiable 187.04s
% Output : Refutation 187.04s
% 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/SystemOnTPTP9463/MGT/MGT018-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 = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 13]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 4] [nf = 0] [nu = 4] [ut = 15]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 8] [nf = 0] [nu = 8] [ut = 15]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 12] [nf = 0] [nu = 12] [ut = 15]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 16] [nf = 0] [nu = 16] [ut = 15]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 20] [nf = 0] [nu = 20] [ut = 15]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 24] [nf = 0] [nu = 24] [ut = 15]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 28] [nf = 0] [nu = 28] [ut = 15]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 46] [nf = 84] [nu = 32] [ut = 15]
% Looking for a proof at depth = 9 ...
% t = 5 secs [nr = 2468414] [nf = 86120] [nu = 282276] [ut = 16]
% Looking for a proof at depth = 10 ...
% t = 51 secs [nr = 23293868] [nf = 372150] [nu = 4003240] [ut = 16]
% Looking for a proof at depth = 11 ...
% t = 108 secs [nr = 51927683] [nf = 377720] [nu = 9260684] [ut = 16]
% Looking for a proof at depth = 12 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: greater_2(sk7_0(),sk6_0())
% B1: organization_2(sk2_0(),sk8_0())
% B2: organization_2(sk3_0(),sk8_0())
% B13: ~organization_2(x0,x1) | inertia_3(x0,sk1_2(x1,x0),x1)
% B14: ~greater_2(x6,x5) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~class_3(x2,x4,x3) | ~class_3(x0,x4,x1) | ~inertia_3(x2,x8,x3) | ~inertia_3(x0,x7,x1) | ~size_3(x2,x6,x3) | ~size_3(x0,x5,x1) | greater_2(x8,x7)
% B15: ~greater_2(x8,x7) | ~organization_2(x2,x1) | ~organization_2(x0,x1) | ~class_3(x2,x4,x1) | ~class_3(x0,x4,x1) | ~inertia_3(x2,x8,x1) | ~inertia_3(x0,x7,x1) | ~reorganization_3(x2,x1,x3) | ~reorganization_3(x0,x1,x5) | ~reorganization_type_3(x2,x6,x1) | ~reorganization_type_3(x0,x6,x1) | greater_2(x5,x3) | organization_2(x2,x3)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c2 t2 td1 b nc > organization_2(sk2_0(),sk8_0())
% U2: < d0 v0 dv0 f0 c2 t2 td1 b nc > organization_2(sk3_0(),sk8_0())
% U3: < d0 v0 dv0 f0 c2 t2 td1 b nc > ~organization_2(sk3_0(),sk10_0())
% U4: < d0 v0 dv0 f0 c3 t3 td1 b nc > class_3(sk2_0(),sk5_0(),sk8_0())
% U5: < d0 v0 dv0 f0 c3 t3 td1 b nc > class_3(sk3_0(),sk5_0(),sk8_0())
% U6: < d0 v0 dv0 f0 c3 t3 td1 b nc > reorganization_3(sk2_0(),sk8_0(),sk9_0())
% U7: < d0 v0 dv0 f0 c3 t3 td1 b nc > reorganization_3(sk3_0(),sk8_0(),sk10_0())
% U8: < d0 v0 dv0 f0 c3 t3 td1 b nc > reorganization_type_3(sk2_0(),sk4_0(),sk8_0())
% U9: < d0 v0 dv0 f0 c3 t3 td1 b nc > reorganization_type_3(sk3_0(),sk4_0(),sk8_0())
% U10: < d0 v0 dv0 f0 c3 t3 td1 b nc > size_3(sk2_0(),sk6_0(),sk8_0())
% U11: < d0 v0 dv0 f0 c3 t3 td1 b nc > size_3(sk3_0(),sk7_0(),sk8_0())
% U12: < d0 v0 dv0 f0 c2 t2 td1 b nc > ~greater_2(sk9_0(),sk10_0())
% U13: < d1 v0 dv0 f1 c4 t5 td2 > inertia_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0())
% U14: < d1 v0 dv0 f1 c4 t5 td2 > inertia_3(sk3_0(),sk1_2(sk8_0(),sk3_0()),sk8_0())
% U15: < d9 v0 dv0 f2 c4 t6 td2 > greater_2(sk1_2(sk8_0(),sk3_0()),sk1_2(sk8_0(),sk2_0()))
% U16: < d12 v0 dv0 f0 c2 t2 td1 > organization_2(sk3_0(),sk10_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% organization_2(sk2_0(),sk8_0()) ....... U1
% Derivation of unit clause U2:
% organization_2(sk3_0(),sk8_0()) ....... U2
% Derivation of unit clause U3:
% ~organization_2(sk3_0(),sk10_0()) ....... U3
% Derivation of unit clause U4:
% class_3(sk2_0(),sk5_0(),sk8_0()) ....... U4
% Derivation of unit clause U5:
% class_3(sk3_0(),sk5_0(),sk8_0()) ....... U5
% Derivation of unit clause U6:
% reorganization_3(sk2_0(),sk8_0(),sk9_0()) ....... U6
% Derivation of unit clause U7:
% reorganization_3(sk3_0(),sk8_0(),sk10_0()) ....... U7
% Derivation of unit clause U8:
% reorganization_type_3(sk2_0(),sk4_0(),sk8_0()) ....... U8
% Derivation of unit clause U9:
% reorganization_type_3(sk3_0(),sk4_0(),sk8_0()) ....... U9
% Derivation of unit clause U10:
% size_3(sk2_0(),sk6_0(),sk8_0()) ....... U10
% Derivation of unit clause U11:
% size_3(sk3_0(),sk7_0(),sk8_0()) ....... U11
% Derivation of unit clause U12:
% ~greater_2(sk9_0(),sk10_0()) ....... U12
% Derivation of unit clause U13:
% organization_2(sk2_0(),sk8_0()) ....... B1
% ~organization_2(x0,x1) | inertia_3(x0,sk1_2(x1,x0),x1) ....... B13
% inertia_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) ....... R1 [B1:L0, B13:L0]
% Derivation of unit clause U14:
% organization_2(sk3_0(),sk8_0()) ....... B2
% ~organization_2(x0,x1) | inertia_3(x0,sk1_2(x1,x0),x1) ....... B13
% inertia_3(sk3_0(), sk1_2(sk8_0(), sk3_0()), sk8_0()) ....... R1 [B2:L0, B13:L0]
% Derivation of unit clause U15:
% greater_2(sk7_0(),sk6_0()) ....... B0
% ~greater_2(x6,x5) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~class_3(x2,x4,x3) | ~class_3(x0,x4,x1) | ~inertia_3(x2,x8,x3) | ~inertia_3(x0,x7,x1) | ~size_3(x2,x6,x3) | ~size_3(x0,x5,x1) | greater_2(x8,x7) ....... B14
% ~organization_2(x0, x1) | ~organization_2(x2, x3) | ~class_3(x0, x4, x1) | ~class_3(x2, x4, x3) | ~inertia_3(x0, x5, x1) | ~inertia_3(x2, x6, x3) | ~size_3(x0, sk7_0(), x1) | ~size_3(x2, sk6_0(), x3) | greater_2(x5, x6) ....... R1 [B0:L0, B14:L0]
% organization_2(sk3_0(),sk8_0()) ....... U2
% ~organization_2(x0, x1) | ~class_3(sk3_0(), x2, sk8_0()) | ~class_3(x0, x2, x1) | ~inertia_3(sk3_0(), x3, sk8_0()) | ~inertia_3(x0, x4, x1) | ~size_3(sk3_0(), sk7_0(), sk8_0()) | ~size_3(x0, sk6_0(), x1) | greater_2(x3, x4) ....... R2 [R1:L0, U2:L0]
% organization_2(sk2_0(),sk8_0()) ....... U1
% ~class_3(sk3_0(), x0, sk8_0()) | ~class_3(sk2_0(), x0, sk8_0()) | ~inertia_3(sk3_0(), x1, sk8_0()) | ~inertia_3(sk2_0(), x2, sk8_0()) | ~size_3(sk3_0(), sk7_0(), sk8_0()) | ~size_3(sk2_0(), sk6_0(), sk8_0()) | greater_2(x1, x2) ....... R3 [R2:L0, U1:L0]
% class_3(sk3_0(),sk5_0(),sk8_0()) ....... U5
% ~class_3(sk2_0(), sk5_0(), sk8_0()) | ~inertia_3(sk3_0(), x0, sk8_0()) | ~inertia_3(sk2_0(), x1, sk8_0()) | ~size_3(sk3_0(), sk7_0(), sk8_0()) | ~size_3(sk2_0(), sk6_0(), sk8_0()) | greater_2(x0, x1) ....... R4 [R3:L0, U5:L0]
% class_3(sk2_0(),sk5_0(),sk8_0()) ....... U4
% ~inertia_3(sk3_0(), x0, sk8_0()) | ~inertia_3(sk2_0(), x1, sk8_0()) | ~size_3(sk3_0(), sk7_0(), sk8_0()) | ~size_3(sk2_0(), sk6_0(), sk8_0()) | greater_2(x0, x1) ....... R5 [R4:L0, U4:L0]
% inertia_3(sk3_0(),sk1_2(sk8_0(),sk3_0()),sk8_0()) ....... U14
% ~inertia_3(sk2_0(), x0, sk8_0()) | ~size_3(sk3_0(), sk7_0(), sk8_0()) | ~size_3(sk2_0(), sk6_0(), sk8_0()) | greater_2(sk1_2(sk8_0(), sk3_0()), x0) ....... R6 [R5:L0, U14:L0]
% inertia_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0()) ....... U13
% ~size_3(sk3_0(), sk7_0(), sk8_0()) | ~size_3(sk2_0(), sk6_0(), sk8_0()) | greater_2(sk1_2(sk8_0(), sk3_0()), sk1_2(sk8_0(), sk2_0())) ....... R7 [R6:L0, U13:L0]
% size_3(sk3_0(),sk7_0(),sk8_0()) ....... U11
% ~size_3(sk2_0(), sk6_0(), sk8_0()) | greater_2(sk1_2(sk8_0(), sk3_0()), sk1_2(sk8_0(), sk2_0())) ....... R8 [R7:L0, U11:L0]
% size_3(sk2_0(),sk6_0(),sk8_0()) ....... U10
% greater_2(sk1_2(sk8_0(), sk3_0()), sk1_2(sk8_0(), sk2_0())) ....... R9 [R8:L0, U10:L0]
% Derivation of unit clause U16:
% organization_2(sk2_0(),sk8_0()) ....... B1
% ~greater_2(x8,x7) | ~organization_2(x2,x1) | ~organization_2(x0,x1) | ~class_3(x2,x4,x1) | ~class_3(x0,x4,x1) | ~inertia_3(x2,x8,x1) | ~inertia_3(x0,x7,x1) | ~reorganization_3(x2,x1,x3) | ~reorganization_3(x0,x1,x5) | ~reorganization_type_3(x2,x6,x1) | ~reorganization_type_3(x0,x6,x1) | greater_2(x5,x3) | organization_2(x2,x3) ....... B15
% ~greater_2(x0, x1) | ~organization_2(x2, sk8_0()) | ~class_3(x2, x3, sk8_0()) | ~class_3(sk2_0(), x3, sk8_0()) | ~inertia_3(x2, x0, sk8_0()) | ~inertia_3(sk2_0(), x1, sk8_0()) | ~reorganization_3(x2, sk8_0(), x4) | ~reorganization_3(sk2_0(), sk8_0(), x5) | ~reorganization_type_3(x2, x6, sk8_0()) | ~reorganization_type_3(sk2_0(), x6, sk8_0()) | greater_2(x5, x4) | organization_2(x2, x4) ....... R1 [B1:L0, B15:L2]
% greater_2(sk1_2(sk8_0(),sk3_0()),sk1_2(sk8_0(),sk2_0())) ....... U15
% ~organization_2(x0, sk8_0()) | ~class_3(x0, x1, sk8_0()) | ~class_3(sk2_0(), x1, sk8_0()) | ~inertia_3(x0, sk1_2(sk8_0(), sk3_0()), sk8_0()) | ~inertia_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reorganization_3(x0, sk8_0(), x2) | ~reorganization_3(sk2_0(), sk8_0(), x3) | ~reorganization_type_3(x0, x4, sk8_0()) | ~reorganization_type_3(sk2_0(), x4, sk8_0()) | greater_2(x3, x2) | organization_2(x0, x2) ....... R2 [R1:L0, U15:L0]
% organization_2(sk3_0(),sk8_0()) ....... U2
% ~class_3(sk3_0(), x0, sk8_0()) | ~class_3(sk2_0(), x0, sk8_0()) | ~inertia_3(sk3_0(), sk1_2(sk8_0(), sk3_0()), sk8_0()) | ~inertia_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reorganization_3(sk3_0(), sk8_0(), x1) | ~reorganization_3(sk2_0(), sk8_0(), x2) | ~reorganization_type_3(sk3_0(), x3, sk8_0()) | ~reorganization_type_3(sk2_0(), x3, sk8_0()) | greater_2(x2, x1) | organization_2(sk3_0(), x1) ....... R3 [R2:L0, U2:L0]
% class_3(sk3_0(),sk5_0(),sk8_0()) ....... U5
% ~class_3(sk2_0(), sk5_0(), sk8_0()) | ~inertia_3(sk3_0(), sk1_2(sk8_0(), sk3_0()), sk8_0()) | ~inertia_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reorganization_3(sk3_0(), sk8_0(), x0) | ~reorganization_3(sk2_0(), sk8_0(), x1) | ~reorganization_type_3(sk3_0(), x2, sk8_0()) | ~reorganization_type_3(sk2_0(), x2, sk8_0()) | greater_2(x1, x0) | organization_2(sk3_0(), x0) ....... R4 [R3:L0, U5:L0]
% class_3(sk2_0(),sk5_0(),sk8_0()) ....... U4
% ~inertia_3(sk3_0(), sk1_2(sk8_0(), sk3_0()), sk8_0()) | ~inertia_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reorganization_3(sk3_0(), sk8_0(), x0) | ~reorganization_3(sk2_0(), sk8_0(), x1) | ~reorganization_type_3(sk3_0(), x2, sk8_0()) | ~reorganization_type_3(sk2_0(), x2, sk8_0()) | greater_2(x1, x0) | organization_2(sk3_0(), x0) ....... R5 [R4:L0, U4:L0]
% inertia_3(sk3_0(),sk1_2(sk8_0(),sk3_0()),sk8_0()) ....... U14
% ~inertia_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reorganization_3(sk3_0(), sk8_0(), x0) | ~reorganization_3(sk2_0(), sk8_0(), x1) | ~reorganization_type_3(sk3_0(), x2, sk8_0()) | ~reorganization_type_3(sk2_0(), x2, sk8_0()) | greater_2(x1, x0) | organization_2(sk3_0(), x0) ....... R6 [R5:L0, U14:L0]
% inertia_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0()) ....... U13
% ~reorganization_3(sk3_0(), sk8_0(), x0) | ~reorganization_3(sk2_0(), sk8_0(), x1) | ~reorganization_type_3(sk3_0(), x2, sk8_0()) | ~reorganization_type_3(sk2_0(), x2, sk8_0()) | greater_2(x1, x0) | organization_2(sk3_0(), x0) ....... R7 [R6:L0, U13:L0]
% reorganization_3(sk3_0(),sk8_0(),sk10_0()) ....... U7
% ~reorganization_3(sk2_0(), sk8_0(), x0) | ~reorganization_type_3(sk3_0(), x1, sk8_0()) | ~reorganization_type_3(sk2_0(), x1, sk8_0()) | greater_2(x0, sk10_0()) | organization_2(sk3_0(), sk10_0()) ....... R8 [R7:L0, U7:L0]
% reorganization_3(sk2_0(),sk8_0(),sk9_0()) ....... U6
% ~reorganization_type_3(sk3_0(), x0, sk8_0()) | ~reorganization_type_3(sk2_0(), x0, sk8_0()) | greater_2(sk9_0(), sk10_0()) | organization_2(sk3_0(), sk10_0()) ....... R9 [R8:L0, U6:L0]
% reorganization_type_3(sk3_0(),sk4_0(),sk8_0()) ....... U9
% ~reorganization_type_3(sk2_0(), sk4_0(), sk8_0()) | greater_2(sk9_0(), sk10_0()) | organization_2(sk3_0(), sk10_0()) ....... R10 [R9:L0, U9:L0]
% reorganization_type_3(sk2_0(),sk4_0(),sk8_0()) ....... U8
% greater_2(sk9_0(), sk10_0()) | organization_2(sk3_0(), sk10_0()) ....... R11 [R10:L0, U8:L0]
% ~greater_2(sk9_0(),sk10_0()) ....... U12
% organization_2(sk3_0(), sk10_0()) ....... R12 [R11:L0, U12:L0]
% Derivation of the empty clause:
% organization_2(sk3_0(),sk10_0()) ....... U16
% ~organization_2(sk3_0(),sk10_0()) ....... U3
% [] ....... R1 [U16:L0, U3:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 88356609
% resolvents: 87968579 factors: 388030
% Number of unit clauses generated: 10842886
% % unit clauses generated to total clauses generated: 12.27
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 13 [1] = 2 [9] = 1 [12] = 1
% Total = 17
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 10842886 [2] = 25461433 [3] = 29987851 [4] = 14471875 [5] = 5661213 [6] = 1548901
% [7] = 322233 [8] = 52145 [9] = 6917 [10] = 797 [11] = 332 [12] = 26
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] greater_2 (+)2 (-)1
% [1] organization_2 (+)3 (-)1
% [2] class_3 (+)2 (-)0
% [3] inertia_3 (+)2 (-)0
% [4] reorganization_3 (+)2 (-)0
% [5] reorganization_type_3 (+)2 (-)0
% [6] size_3 (+)2 (-)0
% ------------------
% Total: (+)15 (-)2
% Total number of unit clauses retained: 17
% Number of clauses skipped because of their length: 5782820
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 29351208
% Number of successful unifications: 88356632
% Number of unification failures: 311403341
% Number of unit to unit unification failures: 4
% N literal unification failure due to lookup root_id table: 172903433
% N base clause resolution failure due to lookup table: 4555425
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 13
% N unit clauses dropped because they exceeded max values: 6252481
% 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: 2
% Number of states in UCFA table: 46
% Total number of terms of all unit clauses in table: 52
% 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.88
% Number of symbols (columns) in UCFA: 51
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 399759973
% ConstructUnitClause() = 6252485
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 7.99 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 472495
% | |
% --------------------------------------------------------
% Elapsed time: 190 secs
% CPU time: 187.00 secs
%
%------------------------------------------------------------------------------