%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : PLA003-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.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:33:29 EST 2010 % Result : Unsatisfiable 31.02s % Output : Refutation 31.02s % 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/SystemOnTPTP19911/PLA/PLA003-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 = 48] [nf = 0] [nu = 17] [ut = 5] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 324] [nf = 0] [nu = 90] [ut = 5] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 1817] [nf = 0] [nu = 455] [ut = 5] % Looking for a proof at depth = 4 ... % t = 1 secs [nr = 9760] [nf = 0] [nu = 2364] [ut = 5] % Looking for a proof at depth = 5 ... % t = 1 secs [nr = 51643] [nf = 0] [nu = 12392] [ut = 5] % Looking for a proof at depth = 6 ... % t = 1 secs [nr = 271694] [nf = 0] [nu = 64937] [ut = 5] % Looking for a proof at depth = 7 ... % t = 3 secs [nr = 1426947] [nf = 0] [nu = 340376] [ut = 5] % Looking for a proof at depth = 8 ... % t = 16 secs [nr = 7486739] [nf = 0] [nu = 1783133] [ut = 5] % Looking for a proof at depth = 9 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 32 secs [nr = 15243976] [nf = 0] [nu = 3629305] [ut = 21] % Looking for a proof at depth = 2 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~can_3(monkey_3(x0,x1,the_bananas_0()),x2,x3) % B1: can_3(monkey_3(l0_0(),floor_0(),nothing_0()),ladder_2(l1_0(),floor_0()),bananas_2(l2_0(),ceiling_0())) % B2: ~can_3(monkey_3(x3,floor_0(),nothing_0()),x1,x2) | can_3(monkey_3(x0,floor_0(),nothing_0()),x1,x2) % B3: ~can_3(monkey_3(x0,x1,the_ladder_0()),ladder_2(x0,x3),x2) | can_3(monkey_3(x0,x1,nothing_0()),ladder_2(x0,floor_0()),x2) % B4: ~can_3(monkey_3(x0,x1,nothing_0()),x2,bananas_2(x0,x1)) | can_3(monkey_3(x0,x1,the_bananas_0()),x2,bananas_2(x0,x1)) % B5: ~can_3(monkey_3(x0,x1,nothing_0()),ladder_2(x0,x1),x2) | can_3(monkey_3(x0,x1,the_ladder_0()),ladder_2(x0,x1),x2) % B7: ~can_3(monkey_3(x2,floor_0(),the_ladder_0()),ladder_2(x2,floor_0()),x1) | can_3(monkey_3(x0,floor_0(),the_ladder_0()),ladder_2(x0,floor_0()),x1) % B10: ~can_3(monkey_3(x0,floor_0(),nothing_0()),ladder_2(x0,floor_0()),x1) | can_3(monkey_3(x0,ceiling_0(),nothing_0()),ladder_2(x0,floor_0()),x1) % Unit Clauses: % -------------- % U1: < d1 v5 dv3 f2 c1 t8 td2 > ~can_3(monkey_3(x0,x1,nothing_0()),x2,bananas_2(x0,x1)) % U5: < d1 v1 dv1 f3 c6 t10 td2 > can_3(monkey_3(x0,floor_0(),nothing_0()),ladder_2(l1_0(),floor_0()),bananas_2(l2_0(),ceiling_0())) % U9: < d1 v0 dv0 f3 c7 t10 td2 > can_3(monkey_3(l1_0(),floor_0(),the_ladder_0()),ladder_2(l1_0(),floor_0()),bananas_2(l2_0(),ceiling_0())) % U14: < d1 v2 dv1 f3 c5 t10 td2 > can_3(monkey_3(x0,floor_0(),the_ladder_0()),ladder_2(x0,floor_0()),bananas_2(l2_0(),ceiling_0())) % U20: < d1 v3 dv1 f3 c4 t10 td2 > ~can_3(monkey_3(x0,floor_0(),nothing_0()),ladder_2(x0,floor_0()),bananas_2(x0,ceiling_0())) % U24: < d2 v4 dv2 f3 c3 t10 td2 > ~can_3(monkey_3(x0,floor_0(),the_ladder_0()),ladder_2(x0,x1),bananas_2(x0,ceiling_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % ~can_3(monkey_3(x0,x1,the_bananas_0()),x2,x3) ....... B0 % ~can_3(monkey_3(x0,x1,nothing_0()),x2,bananas_2(x0,x1)) | can_3(monkey_3(x0,x1,the_bananas_0()),x2,bananas_2(x0,x1)) ....... B4 % ~can_3(monkey_3(x0, x1, nothing_0()), x2, bananas_2(x0, x1)) ....... R1 [B0:L0, B4:L1] % Derivation of unit clause U5: % can_3(monkey_3(l0_0(),floor_0(),nothing_0()),ladder_2(l1_0(),floor_0()),bananas_2(l2_0(),ceiling_0())) ....... B1 % ~can_3(monkey_3(x3,floor_0(),nothing_0()),x1,x2) | can_3(monkey_3(x0,floor_0(),nothing_0()),x1,x2) ....... B2 % can_3(monkey_3(x0, floor_0(), nothing_0()), ladder_2(l1_0(), floor_0()), bananas_2(l2_0(), ceiling_0())) ....... R1 [B1:L0, B2:L0] % Derivation of unit clause U9: % ~can_3(monkey_3(x0,x1,nothing_0()),ladder_2(x0,x1),x2) | can_3(monkey_3(x0,x1,the_ladder_0()),ladder_2(x0,x1),x2) ....... B5 % can_3(monkey_3(x0,floor_0(),nothing_0()),ladder_2(l1_0(),floor_0()),bananas_2(l2_0(),ceiling_0())) ....... U5 % can_3(monkey_3(l1_0(), floor_0(), the_ladder_0()), ladder_2(l1_0(), floor_0()), bananas_2(l2_0(), ceiling_0())) ....... R1 [B5:L0, U5:L0] % Derivation of unit clause U14: % ~can_3(monkey_3(x2,floor_0(),the_ladder_0()),ladder_2(x2,floor_0()),x1) | can_3(monkey_3(x0,floor_0(),the_ladder_0()),ladder_2(x0,floor_0()),x1) ....... B7 % can_3(monkey_3(l1_0(),floor_0(),the_ladder_0()),ladder_2(l1_0(),floor_0()),bananas_2(l2_0(),ceiling_0())) ....... U9 % can_3(monkey_3(x0, floor_0(), the_ladder_0()), ladder_2(x0, floor_0()), bananas_2(l2_0(), ceiling_0())) ....... R1 [B7:L0, U9:L0] % Derivation of unit clause U20: % ~can_3(monkey_3(x0,floor_0(),nothing_0()),ladder_2(x0,floor_0()),x1) | can_3(monkey_3(x0,ceiling_0(),nothing_0()),ladder_2(x0,floor_0()),x1) ....... B10 % ~can_3(monkey_3(x0,x1,nothing_0()),x2,bananas_2(x0,x1)) ....... U1 % ~can_3(monkey_3(x0, floor_0(), nothing_0()), ladder_2(x0, floor_0()), bananas_2(x0, ceiling_0())) ....... R1 [B10:L1, U1:L0] % Derivation of unit clause U24: % ~can_3(monkey_3(x3,floor_0(),nothing_0()),x1,x2) | can_3(monkey_3(x0,floor_0(),nothing_0()),x1,x2) ....... B2 % ~can_3(monkey_3(x0,x1,the_ladder_0()),ladder_2(x0,x3),x2) | can_3(monkey_3(x0,x1,nothing_0()),ladder_2(x0,floor_0()),x2) ....... B3 % can_3(monkey_3(x0, floor_0(), nothing_0()), ladder_2(x1, floor_0()), x2) | ~can_3(monkey_3(x1, floor_0(), the_ladder_0()), ladder_2(x1, x3), x2) ....... R1 [B2:L0, B3:L1] % ~can_3(monkey_3(x0,floor_0(),nothing_0()),ladder_2(x0,floor_0()),bananas_2(x0,ceiling_0())) ....... U20 % ~can_3(monkey_3(x0, floor_0(), the_ladder_0()), ladder_2(x0, x1), bananas_2(x0, ceiling_0())) ....... R2 [R1:L0, U20:L0] % Derivation of the empty clause: % ~can_3(monkey_3(x0,floor_0(),the_ladder_0()),ladder_2(x0,x1),bananas_2(x0,ceiling_0())) ....... U24 % can_3(monkey_3(x0,floor_0(),the_ladder_0()),ladder_2(x0,floor_0()),bananas_2(l2_0(),ceiling_0())) ....... U14 % [] ....... R1 [U24:L0, U14:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 15244035 % resolvents: 15244035 factors: 0 % Number of unit clauses generated: 3629345 % % unit clauses generated to total clauses generated: 23.81 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 1 [1] = 20 [2] = 4 % Total = 25 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 3629345 [2] = 11614690 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] can_3 (+)4 (-)21 % ------------------ % Total: (+)4 (-)21 % Total number of unit clauses retained: 25 % 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: 15244042 % Number of unification failures: 2016253 % Number of unit to unit unification failures: 82 % N literal unification failure due to lookup root_id table: 41735063 % N base clause resolution failure due to lookup table: 15737217 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 35 % N unit clauses dropped because they exceeded max values: 2938509 % 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: 10 % Max term depth in a unit clause: 2 % Number of states in UCFA table: 103 % Total number of terms of all unit clauses in table: 238 % 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.43 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 17260295 % ConstructUnitClause() = 2938533 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 3.74 secs % -------------------------------------------------------- % | | % Inferences per sec: 491743 % | | % -------------------------------------------------------- % Elapsed time: 32 secs % CPU time: 31.00 secs % %------------------------------------------------------------------------------