%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD016-3 : TPTP v5.0.0. Bugfixed v2.1.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 18:23:01 EST 2010 % Result : Unsatisfiable 1.51s % Output : Refutation 1.51s % 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/SystemOnTPTP16810/FLD/FLD016-3+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 = 215] [nf = 0] [nu = 141] [ut = 89] % Looking for a proof at depth = 2 ... % t = 2 secs [nr = 706959] [nf = 82] [nu = 555361] [ut = 15673] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: sum_3(a_0(),u_0(),b_0()) % B1: sum_3(a_0(),v_0(),b_0()) % B5: defined_1(a_0()) % B8: defined_1(v_0()) % B13: ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) % B15: ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) % B26: ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) % B27: ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2) % Unit Clauses: % -------------- % U2: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~sum_3(additive_identity_0(),u_0(),v_0()) % U24: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) % U34: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),v_0(),v_0()) % U15687: < d3 v0 dv0 f1 c3 t4 td2 > ~sum_3(additive_inverse_1(a_0()),b_0(),v_0()) % U15762: < d3 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),b_0(),v_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % ~sum_3(additive_identity_0(),u_0(),v_0()) ....... U2 % Derivation of unit clause U24: % defined_1(a_0()) ....... B5 % ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B15 % sum_3(additive_inverse_1(a_0()), a_0(), additive_identity_0()) ....... R1 [B5:L0, B15:L0] % Derivation of unit clause U34: % defined_1(v_0()) ....... B8 % ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B13 % sum_3(additive_identity_0(), v_0(), v_0()) ....... R1 [B8:L0, B13:L0] % Derivation of unit clause U15687: % sum_3(a_0(),u_0(),b_0()) ....... B0 % ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B26 % ~sum_3(x0, b_0(), x1) | ~sum_3(x0, a_0(), x2) | sum_3(x2, u_0(), x1) ....... R1 [B0:L0, B26:L1] % sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U24 % ~sum_3(additive_inverse_1(a_0()), b_0(), x0) | sum_3(additive_identity_0(), u_0(), x0) ....... R2 [R1:L1, U24:L0] % ~sum_3(additive_identity_0(),u_0(),v_0()) ....... U2 % ~sum_3(additive_inverse_1(a_0()), b_0(), v_0()) ....... R3 [R2:L1, U2:L0] % Derivation of unit clause U15762: % sum_3(a_0(),v_0(),b_0()) ....... B1 % ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2) ....... B27 % ~sum_3(x0, v_0(), x1) | ~sum_3(x2, a_0(), x0) | sum_3(x2, b_0(), x1) ....... R1 [B1:L0, B27:L1] % sum_3(additive_identity_0(),v_0(),v_0()) ....... U34 % ~sum_3(x0, a_0(), additive_identity_0()) | sum_3(x0, b_0(), v_0()) ....... R2 [R1:L0, U34:L0] % sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U24 % sum_3(additive_inverse_1(a_0()), b_0(), v_0()) ....... R3 [R2:L0, U24:L0] % Derivation of the empty clause: % sum_3(additive_inverse_1(a_0()),b_0(),v_0()) ....... U15762 % ~sum_3(additive_inverse_1(a_0()),b_0(),v_0()) ....... U15687 % [] ....... R1 [U15762:L0, U15687:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 708713 % resolvents: 708609 factors: 104 % Number of unit clauses generated: 555677 % % unit clauses generated to total clauses generated: 78.41 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 10 [1] = 79 [2] = 15584 [3] = 90 % Total = 15763 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 555677 [2] = 152907 [3] = 129 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)15128 (-)0 % [1] less_or_equal_2 (+)0 (-)0 % [2] product_3 (+)215 (-)0 % [3] sum_3 (+)415 (-)5 % ------------------ % Total: (+)15758 (-)5 % Total number of unit clauses retained: 15763 % Number of clauses skipped because of their length: 4514 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 708721 % Number of unification failures: 157762 % Number of unit to unit unification failures: 2073 % N literal unification failure due to lookup root_id table: 5116 % N base clause resolution failure due to lookup table: 1968 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 479989 % N unit clauses dropped because too much nesting: 226075 % 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: 8465 % Total number of terms of all unit clauses in table: 104515 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.11 % Ratio n states used/total unit clauses terms: 0.08 % Number of symbols (columns) in UCFA: 48 % Profile 2: Number of calls to: % ============================== % PTUnify() = 866483 % ConstructUnitClause() = 495742 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.53 secs % -------------------------------------------------------- % | | % Inferences per sec: 708713 % | | % -------------------------------------------------------- % Elapsed time: 2 secs % CPU time: 1.50 secs % %------------------------------------------------------------------------------