%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : PUZ047-1 : TPTP v5.0.0. Released v2.5.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art01.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 04:09:55 EST 2010 % Result : Unsatisfiable 0.14s % Output : Refutation 0.14s % 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/SystemOnTPTP7917/PUZ/PUZ047-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 = 1 secs [nr = 45] [nf = 0] [nu = 7] [ut = 7] % Looking for a proof at depth = 2 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: p_5(south_0(),south_0(),south_0(),south_0(),start_0()) % B1: ~p_5(south_0(),x0,south_0(),x1,x2) | p_5(north_0(),x0,north_0(),x1,take_goat_1(x2)) % B2: ~p_5(north_0(),x0,north_0(),x1,x2) | p_5(south_0(),x0,south_0(),x1,take_goat_1(x2)) % B3: ~p_5(south_0(),south_0(),south_0(),north_0(),x0) | p_5(north_0(),north_0(),south_0(),north_0(),take_wolf_1(x0)) % B5: ~p_5(south_0(),south_0(),north_0(),south_0(),x0) | p_5(north_0(),south_0(),north_0(),north_0(),take_cabbage_1(x0)) % B9: ~p_5(north_0(),south_0(),north_0(),south_0(),x0) | p_5(south_0(),south_0(),north_0(),south_0(),go_alone_1(x0)) % B13: ~p_5(north_0(),north_0(),south_0(),north_0(),x0) | p_5(south_0(),north_0(),south_0(),north_0(),go_alone_1(x0)) % Unit Clauses: % -------------- % U1: < d0 v1 dv1 f0 c4 t5 td1 b nc > ~p_5(north_0(),north_0(),north_0(),north_0(),x0) % U2: < d1 v0 dv0 f1 c5 t6 td2 > p_5(north_0(),south_0(),north_0(),south_0(),take_goat_1(start_0())) % U3: < d1 v1 dv1 f0 c4 t5 td1 > ~p_5(south_0(),north_0(),south_0(),north_0(),x0) % U6: < d1 v1 dv1 f0 c4 t5 td1 > ~p_5(north_0(),north_0(),south_0(),north_0(),x0) % U8: < d2 v1 dv1 f0 c4 t5 td1 > ~p_5(north_0(),south_0(),north_0(),north_0(),x0) % U12: < d2 v1 dv1 f0 c4 t5 td1 > ~p_5(north_0(),south_0(),north_0(),south_0(),x0) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % ~p_5(north_0(),north_0(),north_0(),north_0(),x0) ....... U1 % Derivation of unit clause U2: % p_5(south_0(),south_0(),south_0(),south_0(),start_0()) ....... B0 % ~p_5(south_0(),x0,south_0(),x1,x2) | p_5(north_0(),x0,north_0(),x1,take_goat_1(x2)) ....... B1 % p_5(north_0(), south_0(), north_0(), south_0(), take_goat_1(start_0())) ....... R1 [B0:L0, B1:L0] % Derivation of unit clause U3: % ~p_5(south_0(),x0,south_0(),x1,x2) | p_5(north_0(),x0,north_0(),x1,take_goat_1(x2)) ....... B1 % ~p_5(north_0(),north_0(),north_0(),north_0(),x0) ....... U1 % ~p_5(south_0(), north_0(), south_0(), north_0(), x0) ....... R1 [B1:L1, U1:L0] % Derivation of unit clause U6: % ~p_5(north_0(),north_0(),south_0(),north_0(),x0) | p_5(south_0(),north_0(),south_0(),north_0(),go_alone_1(x0)) ....... B13 % ~p_5(south_0(),north_0(),south_0(),north_0(),x0) ....... U3 % ~p_5(north_0(), north_0(), south_0(), north_0(), x0) ....... R1 [B13:L1, U3:L0] % Derivation of unit clause U8: % ~p_5(north_0(),x0,north_0(),x1,x2) | p_5(south_0(),x0,south_0(),x1,take_goat_1(x2)) ....... B2 % ~p_5(south_0(),south_0(),south_0(),north_0(),x0) | p_5(north_0(),north_0(),south_0(),north_0(),take_wolf_1(x0)) ....... B3 % ~p_5(north_0(), south_0(), north_0(), north_0(), x0) | p_5(north_0(), north_0(), south_0(), north_0(), take_wolf_1(take_goat_1(x0))) ....... R1 [B2:L1, B3:L0] % ~p_5(north_0(),north_0(),south_0(),north_0(),x0) ....... U6 % ~p_5(north_0(), south_0(), north_0(), north_0(), x0) ....... R2 [R1:L1, U6:L0] % Derivation of unit clause U12: % ~p_5(south_0(),south_0(),north_0(),south_0(),x0) | p_5(north_0(),south_0(),north_0(),north_0(),take_cabbage_1(x0)) ....... B5 % ~p_5(north_0(),south_0(),north_0(),south_0(),x0) | p_5(south_0(),south_0(),north_0(),south_0(),go_alone_1(x0)) ....... B9 % p_5(north_0(), south_0(), north_0(), north_0(), take_cabbage_1(go_alone_1(x0))) | ~p_5(north_0(), south_0(), north_0(), south_0(), x0) ....... R1 [B5:L0, B9:L1] % ~p_5(north_0(),south_0(),north_0(),north_0(),x0) ....... U8 % ~p_5(north_0(), south_0(), north_0(), south_0(), x0) ....... R2 [R1:L0, U8:L0] % Derivation of the empty clause: % ~p_5(north_0(),south_0(),north_0(),south_0(),x0) ....... U12 % p_5(north_0(),south_0(),north_0(),south_0(),take_goat_1(start_0())) ....... U2 % [] ....... R1 [U12:L0, U2:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 209 % resolvents: 209 factors: 0 % Number of unit clauses generated: 40 % % unit clauses generated to total clauses generated: 19.14 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [1] = 5 [2] = 6 % Total = 13 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 40 [2] = 169 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] p_5 (+)6 (-)7 % ------------------ % Total: (+)6 (-)7 % Total number of unit clauses retained: 13 % Number of clauses skipped because of their length: 0 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 216 % Number of unification failures: 69 % Number of unit to unit unification failures: 37 % N literal unification failure due to lookup root_id table: 713 % N base clause resolution failure due to lookup table: 527 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 6 % N unit clauses dropped because they exceeded max values: 18 % N unit clauses dropped because too much nesting: 9 % 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: 43 % Total number of terms of all unit clauses in table: 76 % 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.57 % Number of symbols (columns) in UCFA: 42 % Profile 2: Number of calls to: % ============================== % PTUnify() = 285 % ConstructUnitClause() = 29 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.14 secs % %------------------------------------------------------------------------------