%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : PLA022-2 : TPTP v5.0.0. Released v1.1.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 03:47:47 EST 2010 % Result : Unsatisfiable 1.36s % Output : Refutation 1.36s % 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/SystemOnTPTP5524/PLA/PLA022-2+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 = 123] [nf = 0] [nu = 46] [ut = 38] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 43124] [nf = 2] [nu = 35048] [ut = 3543] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 147645] [nf = 106] [nu = 121577] [ut = 4246] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~holds_2(and_2(on_2(a_0(),c_0()),on_2(c_0(),d_0())),x0) % B2: differ_2(a_0(),table_0()) % B4: differ_2(a_0(),c_0()) % B15: holds_2(clear_1(c_0()),s0_0()) % B18: holds_2(on_2(c_0(),d_0()),s0_0()) % B21: ~differ_2(x1,x0) | differ_2(x0,x1) % B23: ~differ_2(x0,x2) | ~holds_2(on_2(x0,x1),x3) | holds_2(on_2(x0,x1),do_2(pickup_1(x2),x3)) % B24: ~holds_2(x1,x2) | ~holds_2(x0,x2) | holds_2(and_2(x0,x1),x2) % B25: ~differ_2(x0,x1) | ~holds_2(clear_1(x0),x2) | holds_2(clear_1(x0),do_2(pickup_1(x1),x2)) % B30: ~differ_2(x0,table_0()) | ~holds_2(clear_1(x0),x1) | ~holds_2(empty_0(),x1) | holds_2(holding_1(x0),do_2(pickup_1(x0),x1)) % Unit Clauses: % -------------- % U12: < d0 v0 dv0 f0 c2 t2 td1 b > holds_2(empty_0(),s0_0()) % U13: < d0 v0 dv0 f1 c2 t3 td2 b > holds_2(clear_1(a_0()),s0_0()) % U22: < d1 v0 dv0 f0 c2 t2 td1 > differ_2(c_0(),a_0()) % U1958: < d2 v0 dv0 f3 c3 t6 td3 > holds_2(clear_1(c_0()),do_2(pickup_1(a_0()),s0_0())) % U3548: < d3 v0 dv0 f3 c3 t6 td3 > holds_2(holding_1(a_0()),do_2(pickup_1(a_0()),s0_0())) % U3564: < d3 v2 dv2 f5 c4 t11 td4 > holds_2(on_2(c_0(),d_0()),do_2(putdown_2(x0,x1),do_2(pickup_1(a_0()),s0_0()))) % U4273: < d4 v0 dv0 f3 c3 t6 td3 > ~holds_2(holding_1(a_0()),do_2(pickup_1(a_0()),s0_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U12: % holds_2(empty_0(),s0_0()) ....... U12 % Derivation of unit clause U13: % holds_2(clear_1(a_0()),s0_0()) ....... U13 % Derivation of unit clause U22: % differ_2(a_0(),c_0()) ....... B4 % ~differ_2(x1,x0) | differ_2(x0,x1) ....... B21 % differ_2(c_0(), a_0()) ....... R1 [B4:L0, B21:L0] % Derivation of unit clause U1958: % holds_2(clear_1(c_0()),s0_0()) ....... B15 % ~differ_2(x0,x1) | ~holds_2(clear_1(x0),x2) | holds_2(clear_1(x0),do_2(pickup_1(x1),x2)) ....... B25 % ~differ_2(c_0(), x0) | holds_2(clear_1(c_0()), do_2(pickup_1(x0), s0_0())) ....... R1 [B15:L0, B25:L1] % differ_2(c_0(),a_0()) ....... U22 % holds_2(clear_1(c_0()), do_2(pickup_1(a_0()), s0_0())) ....... R2 [R1:L0, U22:L0] % Derivation of unit clause U3548: % differ_2(a_0(),table_0()) ....... B2 % ~differ_2(x0,table_0()) | ~holds_2(clear_1(x0),x1) | ~holds_2(empty_0(),x1) | holds_2(holding_1(x0),do_2(pickup_1(x0),x1)) ....... B30 % ~holds_2(clear_1(a_0()), x0) | ~holds_2(empty_0(), x0) | holds_2(holding_1(a_0()), do_2(pickup_1(a_0()), x0)) ....... R1 [B2:L0, B30:L0] % holds_2(clear_1(a_0()),s0_0()) ....... U13 % ~holds_2(empty_0(), s0_0()) | holds_2(holding_1(a_0()), do_2(pickup_1(a_0()), s0_0())) ....... R2 [R1:L0, U13:L0] % holds_2(empty_0(),s0_0()) ....... U12 % holds_2(holding_1(a_0()), do_2(pickup_1(a_0()), s0_0())) ....... R3 [R2:L0, U12:L0] % Derivation of unit clause U3564: % holds_2(on_2(c_0(),d_0()),s0_0()) ....... B18 % ~differ_2(x0,x2) | ~holds_2(on_2(x0,x1),x3) | holds_2(on_2(x0,x1),do_2(pickup_1(x2),x3)) ....... B23 % ~differ_2(c_0(), x0) | holds_2(on_2(c_0(), d_0()), do_2(pickup_1(x0), s0_0())) ....... R1 [B18:L0, B23:L1] % ~holds_2(on_2(x0,x1),x4) | holds_2(on_2(x0,x1),do_2(putdown_2(x2,x3),x4)) ....... B20 % ~differ_2(c_0(), x0) | holds_2(on_2(c_0(), d_0()), do_2(putdown_2(x1, x2), do_2(pickup_1(x0), s0_0()))) ....... R2 [R1:L1, B20:L0] % differ_2(c_0(),a_0()) ....... U22 % holds_2(on_2(c_0(), d_0()), do_2(putdown_2(x0, x1), do_2(pickup_1(a_0()), s0_0()))) ....... R3 [R2:L0, U22:L0] % Derivation of unit clause U4273: % ~holds_2(and_2(on_2(a_0(),c_0()),on_2(c_0(),d_0())),x0) ....... B0 % ~holds_2(x1,x2) | ~holds_2(x0,x2) | holds_2(and_2(x0,x1),x2) ....... B24 % ~holds_2(on_2(c_0(), d_0()), x0) | ~holds_2(on_2(a_0(), c_0()), x0) ....... R1 [B0:L0, B24:L2] % ~holds_2(clear_1(x1),x2) | ~holds_2(holding_1(x0),x2) | holds_2(on_2(x0,x1),do_2(putdown_2(x0,x1),x2)) ....... B28 % ~holds_2(on_2(c_0(), d_0()), do_2(putdown_2(a_0(), c_0()), x0)) | ~holds_2(clear_1(c_0()), x0) | ~holds_2(holding_1(a_0()), x0) ....... R2 [R1:L1, B28:L2] % holds_2(on_2(c_0(),d_0()),do_2(putdown_2(x0,x1),do_2(pickup_1(a_0()),s0_0()))) ....... U3564 % ~holds_2(clear_1(c_0()), do_2(pickup_1(a_0()), s0_0())) | ~holds_2(holding_1(a_0()), do_2(pickup_1(a_0()), s0_0())) ....... R3 [R2:L0, U3564:L0] % holds_2(clear_1(c_0()),do_2(pickup_1(a_0()),s0_0())) ....... U1958 % ~holds_2(holding_1(a_0()), do_2(pickup_1(a_0()), s0_0())) ....... R4 [R3:L0, U1958:L0] % Derivation of the empty clause: % ~holds_2(holding_1(a_0()),do_2(pickup_1(a_0()),s0_0())) ....... U4273 % holds_2(holding_1(a_0()),do_2(pickup_1(a_0()),s0_0())) ....... U3548 % [] ....... R1 [U4273:L0, U3548:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 148424 % resolvents: 148318 factors: 106 % Number of unit clauses generated: 122033 % % unit clauses generated to total clauses generated: 82.22 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 20 [1] = 18 [2] = 3505 [3] = 703 % [4] = 28 % Total = 4274 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 122033 [2] = 24456 [3] = 1935 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] differ_2 (+)20 (-)0 % [1] holds_2 (+)4213 (-)41 % ------------------ % Total: (+)4233 (-)41 % Total number of unit clauses retained: 4274 % Number of clauses skipped because of their length: 17362 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 148437 % Number of unification failures: 1035185 % Number of unit to unit unification failures: 172039 % N literal unification failure due to lookup root_id table: 3880851 % N base clause resolution failure due to lookup table: 4406 % 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: 48730 % N unit clauses dropped because too much nesting: 21920 % 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: 12 % Max term depth in a unit clause: 5 % Number of states in UCFA table: 8800 % Total number of terms of all unit clauses in table: 46133 % Max allowed number of states in UCFA: 112000 % Ratio n states used/total allowed states: 0.08 % Ratio n states used/total unit clauses terms: 0.19 % Number of symbols (columns) in UCFA: 50 % Profile 2: Number of calls to: % ============================== % PTUnify() = 1183622 % ConstructUnitClause() = 52984 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.10 secs % -------------------------------------------------------- % | | % Inferences per sec: 148424 % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 1.36 secs % %------------------------------------------------------------------------------