%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : MGT006-1 : TPTP v5.0.0. Released v2.4.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art05.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:52:33 EST 2010 % Result : Unsatisfiable 13.67s % Output : Refutation 13.67s % 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/SystemOnTPTP9279/MGT/MGT006-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 = 8] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 9 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 10 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 11 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 12 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 13 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 14 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 15 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 16 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 17 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 18 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 19 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 20 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 21 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 22 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 23 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 24 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 25 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 26 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 27 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 28 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 29 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Looking for a proof at depth = 30 ... % t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 8] % Restarting search with different parameters. % Looking for a proof at depth = 1 ... % t = 0 secs [nr = 4] [nf = 0] [nu = 4] [ut = 10] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 8] [nf = 0] [nu = 8] [ut = 10] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 12] [nf = 0] [nu = 12] [ut = 10] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 16] [nf = 0] [nu = 16] [ut = 10] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 26] [nf = 8] [nu = 20] [ut = 10] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 2359] [nf = 174] [nu = 504] [ut = 11] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 19430] [nf = 516] [nu = 5488] [ut = 11] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 50067] [nf = 882] [nu = 15536] [ut = 11] % Looking for a proof at depth = 9 ... % t = 11 secs [nr = 4719424] [nf = 18198] [nu = 514898] [ut = 13] % Looking for a proof at depth = 10 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: greater_2(sk8_0(),sk7_0()) % B1: organization_2(sk2_0(),sk7_0()) % B2: organization_2(sk2_0(),sk8_0()) % B9: ~organization_2(x0,x1) | reproducibility_3(x0,sk1_2(x1,x0),x1) % B10: ~greater_2(x2,x1) | ~organization_2(x0,x2) | ~organization_2(x0,x1) | ~reorganization_free_3(x0,x1,x2) | ~reproducibility_3(x0,x4,x2) | ~reproducibility_3(x0,x3,x1) | greater_2(x4,x3) % B11: ~greater_2(x9,x8) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~accountability_3(x2,x7,x3) | ~accountability_3(x0,x6,x1) | ~reliability_3(x2,x5,x3) | ~reliability_3(x0,x4,x1) | ~reproducibility_3(x2,x9,x3) | ~reproducibility_3(x0,x8,x1) | greater_2(x5,x4) % B12: ~greater_2(x9,x8) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~accountability_3(x2,x7,x3) | ~accountability_3(x0,x6,x1) | ~reliability_3(x2,x5,x3) | ~reliability_3(x0,x4,x1) | ~reproducibility_3(x2,x9,x3) | ~reproducibility_3(x0,x8,x1) | greater_2(x7,x6) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f0 c2 t2 td1 b nc > organization_2(sk2_0(),sk7_0()) % U2: < d0 v0 dv0 f0 c2 t2 td1 b nc > organization_2(sk2_0(),sk8_0()) % U3: < d0 v0 dv0 f0 c3 t3 td1 b nc > accountability_3(sk2_0(),sk5_0(),sk7_0()) % U4: < d0 v0 dv0 f0 c3 t3 td1 b nc > accountability_3(sk2_0(),sk6_0(),sk8_0()) % U5: < d0 v0 dv0 f0 c3 t3 td1 b nc > reliability_3(sk2_0(),sk3_0(),sk7_0()) % U6: < d0 v0 dv0 f0 c3 t3 td1 b nc > reliability_3(sk2_0(),sk4_0(),sk8_0()) % U7: < d0 v0 dv0 f0 c3 t3 td1 b nc > reorganization_free_3(sk2_0(),sk7_0(),sk8_0()) % U8: < d1 v0 dv0 f1 c4 t5 td2 > reproducibility_3(sk2_0(),sk1_2(sk7_0(),sk2_0()),sk7_0()) % U9: < d1 v0 dv0 f1 c4 t5 td2 > reproducibility_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0()) % U10: < d6 v0 dv0 f2 c4 t6 td2 > greater_2(sk1_2(sk8_0(),sk2_0()),sk1_2(sk7_0(),sk2_0())) % U12: < d9 v0 dv0 f0 c2 t2 td1 > greater_2(sk6_0(),sk5_0()) % U13: < d10 v0 dv0 f0 c2 t2 td1 > ~greater_2(sk6_0(),sk5_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % organization_2(sk2_0(),sk7_0()) ....... U1 % Derivation of unit clause U2: % organization_2(sk2_0(),sk8_0()) ....... U2 % Derivation of unit clause U3: % accountability_3(sk2_0(),sk5_0(),sk7_0()) ....... U3 % Derivation of unit clause U4: % accountability_3(sk2_0(),sk6_0(),sk8_0()) ....... U4 % Derivation of unit clause U5: % reliability_3(sk2_0(),sk3_0(),sk7_0()) ....... U5 % Derivation of unit clause U6: % reliability_3(sk2_0(),sk4_0(),sk8_0()) ....... U6 % Derivation of unit clause U7: % reorganization_free_3(sk2_0(),sk7_0(),sk8_0()) ....... U7 % Derivation of unit clause U8: % organization_2(sk2_0(),sk7_0()) ....... B1 % ~organization_2(x0,x1) | reproducibility_3(x0,sk1_2(x1,x0),x1) ....... B9 % reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) ....... R1 [B1:L0, B9:L0] % Derivation of unit clause U9: % organization_2(sk2_0(),sk8_0()) ....... B2 % ~organization_2(x0,x1) | reproducibility_3(x0,sk1_2(x1,x0),x1) ....... B9 % reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) ....... R1 [B2:L0, B9:L0] % Derivation of unit clause U10: % greater_2(sk8_0(),sk7_0()) ....... B0 % ~greater_2(x2,x1) | ~organization_2(x0,x2) | ~organization_2(x0,x1) | ~reorganization_free_3(x0,x1,x2) | ~reproducibility_3(x0,x4,x2) | ~reproducibility_3(x0,x3,x1) | greater_2(x4,x3) ....... B10 % ~organization_2(x0, sk8_0()) | ~organization_2(x0, sk7_0()) | ~reorganization_free_3(x0, sk7_0(), sk8_0()) | ~reproducibility_3(x0, x1, sk8_0()) | ~reproducibility_3(x0, x2, sk7_0()) | greater_2(x1, x2) ....... R1 [B0:L0, B10:L0] % organization_2(sk2_0(),sk8_0()) ....... U2 % ~organization_2(sk2_0(), sk7_0()) | ~reorganization_free_3(sk2_0(), sk7_0(), sk8_0()) | ~reproducibility_3(sk2_0(), x0, sk8_0()) | ~reproducibility_3(sk2_0(), x1, sk7_0()) | greater_2(x0, x1) ....... R2 [R1:L0, U2:L0] % organization_2(sk2_0(),sk7_0()) ....... U1 % ~reorganization_free_3(sk2_0(), sk7_0(), sk8_0()) | ~reproducibility_3(sk2_0(), x0, sk8_0()) | ~reproducibility_3(sk2_0(), x1, sk7_0()) | greater_2(x0, x1) ....... R3 [R2:L0, U1:L0] % reorganization_free_3(sk2_0(),sk7_0(),sk8_0()) ....... U7 % ~reproducibility_3(sk2_0(), x0, sk8_0()) | ~reproducibility_3(sk2_0(), x1, sk7_0()) | greater_2(x0, x1) ....... R4 [R3:L0, U7:L0] % reproducibility_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0()) ....... U9 % ~reproducibility_3(sk2_0(), x0, sk7_0()) | greater_2(sk1_2(sk8_0(), sk2_0()), x0) ....... R5 [R4:L0, U9:L0] % reproducibility_3(sk2_0(),sk1_2(sk7_0(),sk2_0()),sk7_0()) ....... U8 % greater_2(sk1_2(sk8_0(), sk2_0()), sk1_2(sk7_0(), sk2_0())) ....... R6 [R5:L0, U8:L0] % Derivation of unit clause U12: % organization_2(sk2_0(),sk7_0()) ....... B1 % ~greater_2(x9,x8) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~accountability_3(x2,x7,x3) | ~accountability_3(x0,x6,x1) | ~reliability_3(x2,x5,x3) | ~reliability_3(x0,x4,x1) | ~reproducibility_3(x2,x9,x3) | ~reproducibility_3(x0,x8,x1) | greater_2(x7,x6) ....... B12 % ~greater_2(x0, x1) | ~organization_2(x2, x3) | ~accountability_3(x2, x4, x3) | ~accountability_3(sk2_0(), x5, sk7_0()) | ~reliability_3(x2, x6, x3) | ~reliability_3(sk2_0(), x7, sk7_0()) | ~reproducibility_3(x2, x0, x3) | ~reproducibility_3(sk2_0(), x1, sk7_0()) | greater_2(x4, x5) ....... R1 [B1:L0, B12:L2] % greater_2(sk1_2(sk8_0(),sk2_0()),sk1_2(sk7_0(),sk2_0())) ....... U10 % ~organization_2(x0, x1) | ~accountability_3(x0, x2, x1) | ~accountability_3(sk2_0(), x3, sk7_0()) | ~reliability_3(x0, x4, x1) | ~reliability_3(sk2_0(), x5, sk7_0()) | ~reproducibility_3(x0, sk1_2(sk8_0(), sk2_0()), x1) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(x2, x3) ....... R2 [R1:L0, U10:L0] % organization_2(sk2_0(),sk8_0()) ....... U2 % ~accountability_3(sk2_0(), x0, sk8_0()) | ~accountability_3(sk2_0(), x1, sk7_0()) | ~reliability_3(sk2_0(), x2, sk8_0()) | ~reliability_3(sk2_0(), x3, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(x0, x1) ....... R3 [R2:L0, U2:L0] % accountability_3(sk2_0(),sk6_0(),sk8_0()) ....... U4 % ~accountability_3(sk2_0(), x0, sk7_0()) | ~reliability_3(sk2_0(), x1, sk8_0()) | ~reliability_3(sk2_0(), x2, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk6_0(), x0) ....... R4 [R3:L0, U4:L0] % accountability_3(sk2_0(),sk5_0(),sk7_0()) ....... U3 % ~reliability_3(sk2_0(), x0, sk8_0()) | ~reliability_3(sk2_0(), x1, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk6_0(), sk5_0()) ....... R5 [R4:L0, U3:L0] % reliability_3(sk2_0(),sk4_0(),sk8_0()) ....... U6 % ~reliability_3(sk2_0(), x0, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk6_0(), sk5_0()) ....... R6 [R5:L0, U6:L0] % reliability_3(sk2_0(),sk3_0(),sk7_0()) ....... U5 % ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk6_0(), sk5_0()) ....... R7 [R6:L0, U5:L0] % reproducibility_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0()) ....... U9 % ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk6_0(), sk5_0()) ....... R8 [R7:L0, U9:L0] % reproducibility_3(sk2_0(),sk1_2(sk7_0(),sk2_0()),sk7_0()) ....... U8 % greater_2(sk6_0(), sk5_0()) ....... R9 [R8:L0, U8:L0] % Derivation of unit clause U13: % organization_2(sk2_0(),sk7_0()) ....... B1 % ~greater_2(x9,x8) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~accountability_3(x2,x7,x3) | ~accountability_3(x0,x6,x1) | ~reliability_3(x2,x5,x3) | ~reliability_3(x0,x4,x1) | ~reproducibility_3(x2,x9,x3) | ~reproducibility_3(x0,x8,x1) | greater_2(x5,x4) ....... B11 % ~greater_2(x0, x1) | ~organization_2(x2, x3) | ~accountability_3(x2, x4, x3) | ~accountability_3(sk2_0(), x5, sk7_0()) | ~reliability_3(x2, x6, x3) | ~reliability_3(sk2_0(), x7, sk7_0()) | ~reproducibility_3(x2, x0, x3) | ~reproducibility_3(sk2_0(), x1, sk7_0()) | greater_2(x6, x7) ....... R1 [B1:L0, B11:L2] % greater_2(sk1_2(sk8_0(),sk2_0()),sk1_2(sk7_0(),sk2_0())) ....... U10 % ~organization_2(x0, x1) | ~accountability_3(x0, x2, x1) | ~accountability_3(sk2_0(), x3, sk7_0()) | ~reliability_3(x0, x4, x1) | ~reliability_3(sk2_0(), x5, sk7_0()) | ~reproducibility_3(x0, sk1_2(sk8_0(), sk2_0()), x1) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(x4, x5) ....... R2 [R1:L0, U10:L0] % organization_2(sk2_0(),sk8_0()) ....... U2 % ~accountability_3(sk2_0(), x0, sk8_0()) | ~accountability_3(sk2_0(), x1, sk7_0()) | ~reliability_3(sk2_0(), x2, sk8_0()) | ~reliability_3(sk2_0(), x3, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(x2, x3) ....... R3 [R2:L0, U2:L0] % accountability_3(sk2_0(),sk6_0(),sk8_0()) ....... U4 % ~accountability_3(sk2_0(), x0, sk7_0()) | ~reliability_3(sk2_0(), x1, sk8_0()) | ~reliability_3(sk2_0(), x2, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(x1, x2) ....... R4 [R3:L0, U4:L0] % accountability_3(sk2_0(),sk5_0(),sk7_0()) ....... U3 % ~reliability_3(sk2_0(), x0, sk8_0()) | ~reliability_3(sk2_0(), x1, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(x0, x1) ....... R5 [R4:L0, U3:L0] % reliability_3(sk2_0(),sk4_0(),sk8_0()) ....... U6 % ~reliability_3(sk2_0(), x0, sk7_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk4_0(), x0) ....... R6 [R5:L0, U6:L0] % reliability_3(sk2_0(),sk3_0(),sk7_0()) ....... U5 % ~reproducibility_3(sk2_0(), sk1_2(sk8_0(), sk2_0()), sk8_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk4_0(), sk3_0()) ....... R7 [R6:L0, U5:L0] % reproducibility_3(sk2_0(),sk1_2(sk8_0(),sk2_0()),sk8_0()) ....... U9 % ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | greater_2(sk4_0(), sk3_0()) ....... R8 [R7:L0, U9:L0] % ~greater_2(sk6_0(),sk5_0()) | ~greater_2(sk4_0(),sk3_0()) ....... B8 % ~reproducibility_3(sk2_0(), sk1_2(sk7_0(), sk2_0()), sk7_0()) | ~greater_2(sk6_0(), sk5_0()) ....... R9 [R8:L1, B8:L1] % reproducibility_3(sk2_0(),sk1_2(sk7_0(),sk2_0()),sk7_0()) ....... U8 % ~greater_2(sk6_0(), sk5_0()) ....... R10 [R9:L0, U8:L0] % Derivation of the empty clause: % ~greater_2(sk6_0(),sk5_0()) ....... U13 % greater_2(sk6_0(),sk5_0()) ....... U12 % [] ....... R1 [U13:L0, U12:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 5700462 % resolvents: 5680028 factors: 20434 % Number of unit clauses generated: 519851 % % unit clauses generated to total clauses generated: 9.12 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 8 [1] = 2 [6] = 1 [9] = 2 [10] = 1 % Total = 14 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 519851 [2] = 2161472 [3] = 1848059 [4] = 792029 [5] = 283081 [6] = 73555 % [7] = 16248 [8] = 5501 [9] = 634 [10] = 32 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] greater_2 (+)4 (-)1 % [1] organization_2 (+)2 (-)0 % [2] accountability_3 (+)2 (-)0 % [3] reliability_3 (+)2 (-)0 % [4] reorganization_free_3 (+)1 (-)0 % [5] reproducibility_3 (+)2 (-)0 % ------------------ % Total: (+)13 (-)1 % Total number of unit clauses retained: 14 % Number of clauses skipped because of their length: 453834 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 3293921 % Number of successful unifications: 5700489 % Number of unification failures: 21193189 % Number of unit to unit unification failures: 3 % N literal unification failure due to lookup root_id table: 18853810 % N base clause resolution failure due to lookup table: 115579 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 14 % N unit clauses dropped because they exceeded max values: 494075 % 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: 34 % Total number of terms of all unit clauses in table: 43 % 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.79 % Number of symbols (columns) in UCFA: 48 % Profile 2: Number of calls to: % ============================== % PTUnify() = 26893678 % ConstructUnitClause() = 494081 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.54 secs % -------------------------------------------------------- % | | % Inferences per sec: 438497 % | | % -------------------------------------------------------- % Elapsed time: 14 secs % CPU time: 13.66 secs % %------------------------------------------------------------------------------